2168 search results - page 94 / 434 » Randomized Algorithms and Complexity Theory |
141
Voted
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
123
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
142
click to vote
CAV
2001
Springer
15 years 6 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
121
click to vote
STOC
2007
ACM
16 years 3 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
302
click to vote
PAMI
2010
15 years 1 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...