Explore >> Select a destination
|
You are here 
|
fredrikj.net | ||
| | | | |
www.jeremykun.com
|
|
| | | | | Problem: Compute the product of two polynomials efficiently. Solution: import numpy from numpy.fft import fft, ifft def poly_mul(p1, p2): """Multiply two polynomials. p1 and p2 are arrays of coefficients in degree-increasing order. """ deg1 = p1.shape[0] - 1 deg2 = p1.shape[0] - 1 # Would be 2*(deg1 + deg2) + 1, but the next-power-of-2 handles the +1 total_num_pts = 2 * (deg1 + deg2) next_power_of_2 = 1 << (total_num_pts - 1). | |
| | | | |
ondrejcertik.com
|
|
| | | | | [AI summary] A blog post announces the development of fastGPT, a Fortran implementation of GPT-2 inference that outperforms PyTorch in speed on Apple M1 Max processors, leveraging static typing and optimized matrix operations. | |
| | | | |
blag.nullteilerfrei.de
|
|
| | | | | ||
| | | | |
www.arroyo.dev
|
|
| | | Arroyo is the easiest way to run SQL queries against your streaming data | ||
