1039 search results - page 7 / 208 » Query reformulation with constraints |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
DBISP2P
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The both-as-view (BAV) approach to data integration has the advantage of specifying mappings between schemas in a bidirectional manner, so that once a BAV mapping has bee...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
CPAIOR
2009
Springer
14 years 1 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 ...
CP
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...