263 search results - page 10 / 53 » Efficient Variants of the ICP Algorithm |
COLT
2008
Springer
14 years 11 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
81
Voted
SIGIR
1999
ACM
15 years 1 months ago
1999
ACM
We present three distributed algorithms to build global inverted files for very large text collections. The distributed environment we use is a high bandwidth network of workstati...
89
Voted
IPL
2008
14 years 9 months ago
2008
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
71
Voted
TCBB
2008
14 years 9 months ago
2008
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
AOR
2010
14 years 7 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...