1503 search results - page 243 / 301 » Self-optimizing distributed trees |
126
Voted
WINE
2005
Springer
15 years 9 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
129
click to vote
SENSYS
2004
ACM
15 years 8 months ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
141
Voted
DOLAP
2003
ACM
15 years 8 months ago
2003
ACM
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
150
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
126
click to vote
SIGCOMM
1998
ACM
15 years 7 months ago
1998
ACM
Multicast routing enables e cient data distribution to multiple recipients. However, existing work has concentrated on extending single-domain techniques to wide-area networks, ra...