Sciweavers

2354 search results - page 64 / 471
» Radio number for trees
Sort
View
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Deletion without Rebalancing in Multiway Search Trees
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
Siddhartha Sen, Robert Endre Tarjan
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 10 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
15 years 10 months ago
Improving Index Performance through Prefetching
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
Shimin Chen, Phillip B. Gibbons, Todd C. Mowry
CSB
2005
IEEE
182views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Bacterial Whole Genome Phylogeny Using Proteome Comparison and Optimal Reversal Distance
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
Noppadon Khiripet
ICIP
2007
IEEE
15 years 4 months ago
Dual-Layer Visual Vocabulary Tree Hypotheses for Object Recognition
This paper introduces an efficient method to substantially increase the recognition performance of a vocabulary tree based recognition system. We propose to enhance the hypothesi...
Sandra Ober, Martin Winter, Clemens Arth, Horst Bi...