Sciweavers

785 search results - page 6 / 157
» Binary Join Trees
Sort
View
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
15 years 11 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
14 years 9 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye
SWAT
2010
Springer
270views Algorithms» more  SWAT 2010»
15 years 2 months ago
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
IPL
2002
74views more  IPL 2002»
14 years 9 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
MCS
2011
Springer
14 years 4 months ago
The geometry and dynamics of binary trees
: The modeling of a fully populated 3D tree able to regulate dynamically remains a relatively unexplored field. A non-dimensional representation of “autoregulation” coupled wit...
T. David, Thomas van Kempen, Huaxiong Huang, Phill...