2745 search results - page 68 / 549 » A fast algorithm for computing large Fibonacci numbers |
114
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
132
click to vote
CSDA
2008
15 years 3 months ago
2008
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
149
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
144
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
137
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...