Sciweavers

1503 search results - page 19 / 301
» Self-optimizing distributed trees
Sort
View
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
15 years 5 months ago
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
IS
2011
14 years 6 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
RECOMB
2012
Springer
13 years 2 months ago
Recovering the Tree-Like Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis
Abstract. Lateral gene transfer (LGT) is a common mechanism of nonvertical evolution where genetic material is transferred between two more or less distantly related organisms. It ...
Sebastien Roch, Sagi Snir
PAMI
2011
14 years 6 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 11 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye