2924 search results - page 443 / 585 » Lower Bounds in Distributed Computing |
146
Voted
ACCV
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of monocular 3d body pose tracking from video sequences. This task is inherently ambiguous. We propose to learn a generative model of the relationship of bo...
139
click to vote
EDCC
2005
Springer
15 years 10 months ago
2005
Springer
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...
159
click to vote
EMO
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
128
click to vote
AINA
2010
IEEE
15 years 9 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
147
click to vote
LSSC
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...