Sciweavers

3055 search results - page 84 / 611
» Randomized Search Trees
Sort
View
WADS
1993
Springer
136views Algorithms» more  WADS 1993»
14 years 2 months ago
Balanced Search Trees Made Simple
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...
Arne Andersson
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
14 years 2 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
14 years 1 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
WEA
2007
Springer
114views Algorithms» more  WEA 2007»
14 years 4 months ago
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang
CVPR
2000
IEEE
15 years 9 days ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari