310 search results - page 35 / 62 » Randomized Binary Search Trees |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
AAAI
2011
12 years 10 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
COLT
2008
Springer
13 years 11 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
JAIR
2007
13 years 9 months ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
CIKM
2008
Springer
13 years 12 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...