502 search results - page 83 / 101 » Verifying Balanced Trees |
141
Voted
ICWS
2009
IEEE
15 years 8 days ago
2009
IEEE
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
130
Voted
TVCG
2011
14 years 9 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
157
Voted
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
119
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— The goal of data center networking is to interconnect a large number of server machines with low equipment cost, high and balanced network capacity, and robustness to l...
120
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—The overlay-based network architecture has been recognized as an effective way to deal with the funneling effect in sensor networks, where sensors closer to the sink are usually...