Sciweavers

3055 search results - page 27 / 611
» Randomized Search Trees
Sort
View
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
Jiann-Der Lee, Shih-Sen Hsieh, Chung-Hsien Huang, ...
FOCS
2004
IEEE
14 years 21 days ago
Dynamic Optimality -- Almost
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
Erik D. Demaine, Dion Harmon, John Iacono, Mihai P...
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 2 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
NIPS
2007
13 years 10 months ago
Learning the structure of manifolds using random projections
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.
Yoav Freund, Sanjoy Dasgupta, Mayank Kabra, Nakul ...
AIIA
2009
Springer
14 years 3 months ago
Partitioning Search Spaces of a Randomized Search
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...