Sciweavers

460 search results - page 82 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
EDBTW
2010
Springer
14 years 2 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
11 years 10 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns
SIGCOMM
2005
ACM
14 years 1 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
CCGRID
2001
IEEE
13 years 11 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin
MOBISYS
2003
ACM
14 years 7 months ago
An Entity Maintenance and Connection Service for Sensor Networks
In this paper, we present a middleware architecture for coordination services in sensor networks that facilitates interaction between groups of sensors which monitor different env...
Brian M. Blum, Prashant Nagaraddi, Anthony D. Wood...