Sciweavers

675 search results - page 7 / 135
» Biased Range Trees
Sort
View
FSTTCS
2004
Springer
15 years 11 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
CN
2007
116views more  CN 2007»
15 years 5 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
15 years 11 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
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 5 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...
ICRA
2009
IEEE
163views Robotics» more  ICRA 2009»
16 years 16 days ago
3D tree reconstruction from laser range data
— We present a method for reconstructing 3D models of tree branch structure from laser range data. Our approach is probabilistic, and uses a generative model of a tree to guide a...
Jonathan Binney, Gaurav S. Sukhatme