5138 search results - page 180 / 1028 » Randomized Algorithms for 3-SAT |
361
click to vote
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
348
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
170
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
173
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
This paper presents a power grid analyzer based on a random walk technique. A linear-time algorithm is first demonstrated for DC analysis, and is then extended to perform transien...
159
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...