1686 search results - page 246 / 338 » Programs as polygraphs: computability and complexity |
127
click to vote
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
137
click to vote
HPDC
1996
IEEE
15 years 8 months ago
1996
IEEE
' The coming of giga-bit networks makes possible the realization ofa single nationwide virtual computer comprised of a variety of geographically distributed highpe6ormance mac...
292
click to vote
DIMACS
1996
15 years 5 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
148
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
237
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...