2084 search results - page 70 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
STOC
1992
ACM
15 years 1 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
AOR
2007
14 years 10 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
101
click to vote
ECRTS
2010
IEEE
14 years 10 months ago
2010
IEEE
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
CJ
2010
14 years 10 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...