Sciweavers

3055 search results - page 246 / 611
» Randomized Search Trees
Sort
View
FOCS
2008
IEEE
15 years 9 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
EVOW
2007
Springer
15 years 9 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
CVPR
2009
IEEE
16 years 10 months ago
Dictionary-Free Categorization of Very Similar Objects via Stacked Evidence Trees
Current work in object categorization discriminates among objects that typically possess gross differences which are readily apparent. However, many applications require making ...
Andrew Moldenke, Asako Yamamuro, David A. Lytle, E...
RECOMB
2012
Springer
13 years 5 months ago
Recovering the Tree-Like Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis
Abstract. Lateral gene transfer (LGT) is a common mechanism of nonvertical evolution where genetic material is transferred between two more or less distantly related organisms. It ...
Sebastien Roch, Sagi Snir
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 3 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...