4117 search results - page 247 / 824 » On the Satisfiability of Complex Constraints |
179
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
270
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
197
click to vote
CISS
2007
IEEE
16 years 1 months ago
2007
IEEE
Limiting capabilities of practical recognition systems are determined by a variety of factors that include source encoding techniques, quality of images, complexity of underlying ...
149
click to vote
ICRA
2007
IEEE
16 years 29 days ago
2007
IEEE
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...
155
click to vote
LPAR
2007
Springer
16 years 24 days ago
2007
Springer
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...