774 search results - page 128 / 155 » Markov incremental constructions |
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
We present an algorithm to reduce per-pixel search ranges for Markov Random Fields-based stereo algorithms. Our algorithm is based on the intuitions that reliably matched pixels ne...
DAC
2004
ACM
14 years 10 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
ICCD
2002
IEEE
14 years 6 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
ICAC
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper we construct an evaluation framework for a self-healing system, VM-Rejuv – a virtual machine based rejuvenation scheme for web-application servers – using simple...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...