2924 search results - page 371 / 585 » Lower Bounds in Distributed Computing |
114
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...
128
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Failure detectors are a service that provides (approximate) information about process crashes in a distributed system. The well-known “eventually perfect” failure detector, 3P...
209
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
170
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Natural images are known to have scale invariant statistics. While some eariler studies have reported the kurtosis of marginal bandpass filter response distributions to be constant...
144
click to vote
HPCA
2003
IEEE
16 years 5 months ago
2003
IEEE
This paper identifies node affinity as an important property for scalable general-purpose locks. Nonuniform communication architectures (NUCAs), for example CCNUMAs built from a f...