Search Results for "odin source code"
Sort By:
Showing 7 open source projects for "odin source code"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
1
...Some major features are: A built-in expression generator, 32-bit colouring schemes for the fractals, multi-threaded and multi-server rendering! WOW! And lots, lots more... The source code has moved to GitLab: https://gitlab.com/jmmcg/alephone
-
2
fzcal
A calculator capable of complex arithmetics
A command line calculator capable of complex arithmetics. -
3
libNT is a Number Theory Library which is based on a BigInteger Class. It will contain several algorithms for solving Number Theory Problems. Written in the IDE Code::Blocks
-
4
A generic C++ matrix library using expression template and metaprogramming to provide specialized code for various kind of matrix operations.
-
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
5
FFFF is the fastest Win32/OSX/Linux/IRIX Mandelbrot generator. Features OpenGL, realtime zoom, SSE/AltiVec QuadPixel, SSE2/3DNow! DualPixel calc, FPU per pixel calc, GPU asm (Fragment/Vertex) calc, multiprocessor support, and benchmarking. Opt asm code!
-
6
Improving the speed of the signal analysis code for Seti@home. Leveraging modern processors advanced features such as SIMD and parallel execution units, as well as identifying better methods to code existing functions.
-
7
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
- Previous
- You're on page 1
- Next