Sciweavers

216 search results - page 22 / 44
» From Constraints to Finite Automata to Filtering Algorithms
Sort
View
ICPR
2008
IEEE
14 years 9 months ago
Towards estimation of dense disparities from stereo images containing large textureless regions
Stereo algorithms for structure reconstruction demand accurate disparities with low mismatch errors and false positives. Mismatch errors in large textureless regions force most ac...
Cathleen A. Geiger, Chandra Kambhamettu, Gowri Som...
ICPR
2008
IEEE
13 years 9 months ago
Towards estimation of dense disparities from stereo images containing large textureless regions
Stereo algorithms for structure reconstruction demand accurate disparities with low mismatch errors and false positives. Mismatch errors in large textureless regions force most a...
Rohith MV, Gowri Somanath, Chandra Kambhamettu, Ca...
CONCUR
2009
Springer
14 years 3 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong
AAAI
1996
13 years 9 months ago
Learning Models of Intelligent Agents
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
David Carmel, Shaul Markovitch
ENTCS
2008
85views more  ENTCS 2008»
13 years 8 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset