2745 search results - page 28 / 549 » A fast algorithm for computing large Fibonacci numbers |
141
click to vote
CEAS
2006
Springer
15 years 7 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
155
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
150
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
101
click to vote
ISMVL
2002
IEEE
15 years 8 months ago
2002
IEEE
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
163
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...