Sciweavers

829 search results - page 7 / 166
» Bandit Algorithms for Tree Search
Sort
View
ALGORITHMICA
2011
13 years 2 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
IBPRIA
2007
Springer
14 years 1 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
BMCBI
2004
112views more  BMCBI 2004»
13 years 7 months ago
A double classification tree search algorithm for index SNP selection
Background: In population-based studies, it is generally recognized that single nucleotide polymorphism (SNP) markers are not independent. Rather, they are carried by haplotypes, ...
Peisen Zhang, Huitao Sheng, Ryuhei Uehara
SWAT
2010
Springer
270views Algorithms» more  SWAT 2010»
14 years 13 days ago
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
ICCV
2001
IEEE
14 years 9 months ago
Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh