Sciweavers

829 search results - page 92 / 166
» Bandit Algorithms for Tree Search
Sort
View
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
14 years 9 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 11 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
NETWORKING
2008
14 years 11 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
SBBD
2007
148views Database» more  SBBD 2007»
14 years 11 months ago
Bulk-loading Dynamic Metric Access Methods
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
Thiago Galbiatti Vespa, Caetano Traina Jr., Agma J...
WWW
2010
ACM
15 years 4 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...