6608 search results - page 260 / 1322 » On the Completeness of Model Checking |
188
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
187
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
164
click to vote
FMCAD
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
195
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...
156
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper presents our work on rapid language adaptation of acoustic models based on multilingual cross-language bootstrapping and unsupervised training. We used Automatic Speech...