2745 search results - page 255 / 549 » A fast algorithm for computing large Fibonacci numbers |
164
click to vote
TALG
2008
15 years 4 months ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
248
click to vote
ETVC
2008
15 years 6 months ago
2008
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
169
click to vote
ACSC
2006
IEEE
15 years 11 months ago
2006
IEEE
Visual data mining has been established to effectively analyze large, complex numerical data sets. Especially, the extraction and visualization of inherent structures such as hie...
171
click to vote
PAMI
2007
15 years 4 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
128
click to vote
APPT
2009
Springer
15 years 8 months ago
2009
Springer
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...