Sciweavers

285 search results - page 21 / 57
» The complexity of soft constraint satisfaction
Sort
View
71
Voted
FGR
2008
IEEE
142views Biometrics» more  FGR 2008»
15 years 6 months ago
Deformable Face Fitting with Soft Correspondence Constraints
Despite significant progress in deformable model fitting over the last decade, the problem of efficient and accurate person-independentface fitting remains a challenging probl...
Jason M. Saragih, Simon Lucey, Jeffrey F. Cohn
CP
2004
Springer
15 years 5 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
KBS
2007
103views more  KBS 2007»
14 years 11 months ago
A reusable commitment management service using Semantic Web technology
Commitment management is a key issue in service-provisioning in the context of virtual organisations (VOs). A service-provider — which may be a single agent acting within an orga...
Alun D. Preece, Stuart Chalmers, Craig McKenzie
CIE
2008
Springer
14 years 12 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
VLDB
2002
ACM
151views Database» more  VLDB 2002»
14 years 11 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler