Sciweavers

785 search results - page 8 / 157
» Binary Join Trees
Sort
View
TCS
2008
14 years 9 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
JCB
2007
92views more  JCB 2007»
14 years 9 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran
TKDE
1998
122views more  TKDE 1998»
14 years 9 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
INFFUS
2008
175views more  INFFUS 2008»
14 years 9 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi