103 search results - page 13 / 21 » Consistency and Random Constraint Satisfaction Models |
101
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Object models based on bag-of-words representations can achieve state-of-the-art performance for image classification and object localization tasks. However, as they consider obje...
AI
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
AAAI
2000
14 years 10 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
PRICAI
2004
Springer
15 years 2 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
139
click to vote
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...