1058 search results - page 127 / 212 » It's Doomed; We Can Prove It |
265
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
215
click to vote
ECCV
1996
Springer
16 years 8 months ago
1996
Springer
Search is not inherent in the correspondence problem. We propose a representation of images, called intrinsic curves, that combines the ideas of associative storage of images with...
198
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
167
click to vote
ATVA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A distributed system is fault-tolerant if it continues to perform correctly even when a subset of the processes becomes faulty. Faulttolerance is highly desirable but oft...
194
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...