Sciweavers

2924 search results - page 453 / 585
» Lower Bounds in Distributed Computing
Sort
View
161
Voted
SENSYS
2006
ACM
15 years 10 months ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
129
Voted
WCNC
2008
IEEE
15 years 11 months ago
A Density Adaptive Routing Protocol for Large-Scale Ad Hoc Networks
Abstract—Position-based routing protocols use location information to refine the traditional packet flooding method in mobile ad hoc networks. They mainly focus on densely and ...
Zhizhou Li, Yaxiong Zhao, Yong Cui, Dong Xiang
MIDDLEWARE
2007
Springer
15 years 10 months ago
Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems
Abstract. Epidemic protocols have demonstrated remarkable scalability and robustness in disseminating information on internet-scale, dynamic P2P systems. However, popular instances...
Spyros Voulgaris, Maarten van Steen
UAI
2001
15 years 6 months ago
Exact Inference in Networks with Discrete Children of Continuous Parents
Many real life domains contain a mixture of discrete and continuous variables and can be modeled as hybrid Bayesian Networks (BNs). An important subclass of hybrid BNs are conditi...
Uri Lerner, Eran Segal, Daphne Koller
280
Voted
DAGM
2011
Springer
14 years 4 months ago
Agnostic Domain Adaptation
The supervised learning paradigm assumes in general that both training and test data are sampled from the same distribution. When this assumption is violated, we are in the setting...
Alexander Vezhnevets, Joachim M. Buhmann