Search Results for "gift card algorithm"

Fast FDTD solver with graphics card support. Optimized for nanoscale optics - scanning near field optical microscopy, rough surface scattering and solar cells. Uses CUDA environment for graphics card operation.

...This ~2500 lines Pure C factorization software : - is imediately compatible with Microsoft Windows, Linux (no one dependancy) - is a C99 command line factorizer from 0 to 300 bits (330 bits were factored in the lab) - is built so that you can easily use and test the software - use its own "big num" library named cint - use AVL trees to organize information - use Lanczos Block, a pure C iterative matrix eigenvalues finder algorithm - use Pollard's Rho algorithm to answer under 64 bits The Microsoft Windows executable is included in the zip, the readme.md gives you details. Small and larger RSA numbers have been factored by the software, such as the 100 decimal digit number RSA-100. The software factored the 321-bit RSA number relating to the "bank card case".

CUDAPm1 is a modification of CUDALucas that implements the P-1 factoring algorithm for Mersenne numbers using the Fast Fourier Transform implemented by nVidia's cuFFT library. You need a CUDA-capable nVidia card with compute compatibility >= 1.3.

Swift is a DNA sequence alignment program that produces gapped alignment using the Smith-Waterman algorithm. It takes in a query file (FASTA format) and a reference file (FASTA format) as input. It outputs the reference name, read name, gapped alignment, alignment score, alignment start and end positions, and alignment length. I gave a talk on Swift in the GPU Technology Conference 2012. The talk can be accessed at...