- Sort Score
- Result 10 results
- Languages All
Results 51 - 54 of 54 for Multiplication (0.28 sec)
-
docs/fr/docs/async.md
* L'apprentissage automatique (ou **Machine Learning**) : cela nécessite de nombreuses multiplications de matrices et vecteurs. Imaginez une énorme feuille de calcul remplie de nombres que vous multiplierez entre eux tous au même moment.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sun Mar 31 23:52:53 UTC 2024 - 24K bytes - Viewed (0) -
docs/en/docs/async.md
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Mon May 20 00:24:48 UTC 2024 - 23K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_asm_arm64.s
MOVD res+0(FP), res_ptr MOVD in+8(FP), a_ptr MOVD p256const0<>(SB), const0 MOVD p256const1<>(SB), const1 LDP 0*16(a_ptr), (acc0, acc1) LDP 1*16(a_ptr), (acc2, acc3) // Only reduce, no multiplications are needed // First reduction step ADDS acc0<<32, acc1, acc1 LSR $32, acc0, t0 MUL acc0, const1, t1 UMULH acc0, const1, acc0 ADCS t0, acc2 ADCS t1, acc3 ADC $0, acc0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 29.7K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_asm_amd64.s
MOVQ res+0(FP), res_ptr MOVQ in+8(FP), x_ptr MOVQ (8*0)(x_ptr), acc0 MOVQ (8*1)(x_ptr), acc1 MOVQ (8*2)(x_ptr), acc2 MOVQ (8*3)(x_ptr), acc3 XORQ acc4, acc4 // Only reduce, no multiplications are needed // First stage MOVQ acc0, AX MOVQ acc0, t1 SHLQ $32, acc0 MULQ p256const1<>(SB) SHRQ $32, t1 ADDQ acc0, acc1 ADCQ t1, acc2 ADCQ AX, acc3 ADCQ DX, acc4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 39.8K bytes - Viewed (0)