2084 search results - page 192 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
149
Voted
CDC
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
158
Voted
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
194
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
150
click to vote
PKC
2004
Springer
15 years 11 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
165
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...