211 search results - page 30 / 43 » Ground Reducibility is EXPTIME-Complete |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa ...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
SCVMA
2004
Springer
14 years 27 days ago
2004
Springer
We present a method for figure-ground segregation of moving objects from monocular video sequences. The approach is based on tracking extracted contour fragments, in contrast to ...
ECCV
2010
Springer
14 years 27 days ago
2010
Springer
We introduce a real-time stereo matching technique based on a reformulation of Yoon and Kweon’s adaptive support weights algorithm [1]. Our implementation uses the bilateral grid...