Sciweavers

1378 search results - page 42 / 276
» The Tractability of Global Constraints
Sort
View
COMPGEOM
2004
ACM
15 years 7 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 5 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
FGR
2011
IEEE
288views Biometrics» more  FGR 2011»
14 years 5 months ago
Hierarchical CRF with product label spaces for parts-based models
— Non-rigid object detection is a challenging open research problem in computer vision. It is a critical part in many applications such as image search, surveillance, humancomput...
Gemma Roig, Xavier Boix Bosch, Fernando De la Torr...
CORR
2007
Springer
92views Education» more  CORR 2007»
15 years 1 months ago
CD(4) has bounded width
We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they h...
Catarina Carvalho, Víctor Dalmau, Petar Mar...
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
15 years 1 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila