2519 search results - page 304 / 504 » Martingales and Locality in Distributed Computing |
167
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
115
click to vote
DCOSS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
161
Voted
CODASPY
2012
13 years 8 months ago
2012
Recent years have witnessed incredible popularity and adoption of smartphones and mobile devices, which is accompanied by large amount and wide variety of feature-rich smartphone ...
128
Voted
STOC
2012
ACM
13 years 3 months ago
2012
ACM
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...
103
click to vote
CVPR
1999
IEEE
16 years 2 months ago
1999
IEEE
We consider a problem central in aerial visual surveillance applications { detection and tracking of small, independently moving objects in long and noisy video sequences. We dire...