227 search results - page 12 / 46 » Deterministic Sampling Algorithms for Network Design |
118
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
121
click to vote
SASN
2006
ACM
15 years 6 months ago
2006
ACM
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
90
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
91
Voted
IPSN
2005
Springer
15 years 6 months ago
2005
Springer
— We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. ...
100
click to vote
TOCS
2008
15 years 11 days ago
2008
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...