2200 search results - page 15 / 440 » Bloch's Constant is Computable |
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
IEEEPACT
1997
IEEE
15 years 2 months ago
1997
IEEE
This paper addresses the issue of how router complexity a ects the overall performance in deterministic and adaptive routing under virtual cut-through switching in k-ary n-cube ne...
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
107
click to vote
TRIER
2002
14 years 9 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...