Sciweavers

16404 search results - page 3158 / 3281
» A set coverage problem
Sort
View
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
134
Voted
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 8 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
135
Voted
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
15 years 8 months ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
SPAA
2010
ACM
15 years 8 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
138
Voted
EUROCRYPT
2010
Springer
15 years 8 months ago
Adaptively Secure Broadcast
A broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the s...
Martin Hirt, Vassilis Zikas
« Prev « First page 3158 / 3281 Last » Next »