1525 search results - page 73 / 305 » Matching with Regular Constraints |
134
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
144
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
124
Voted
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
125
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
123
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...