711 search results - page 129 / 143 » Amalgams of Constraint Satisfaction Problems |
119
click to vote
STOC
2006
ACM
16 years 20 hour ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
102
Voted
DSS
2008
14 years 11 months ago
2008
The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be cons...
ICML
2007
IEEE
16 years 16 days ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We propose here a new approach for video sequence interpretation based on declarative models of activities. The aim of the video sequence interpretation is to recognize i...
AAAI
1996
15 years 1 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...