2084 search results - page 306 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
NETWORKING
2007
14 years 11 months ago
2007
We propose a novel routing framework called PWave that supports multi-source multi-sink anycast routing for wireless sensor networks. A distributed and scalable potential field es...
108
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
DSN
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
The Conditional Random Fields (CRF) model, using
patch-based classification bound with context information,
has recently been widely adopted for image segmentation/
labeling. In...