351 search results - page 20 / 71 » Perfect Constraints Are Tractable |
IUI
2000
ACM
14 years 21 hour ago
2000
ACM
Thanks to recent scientific advances, it is now possible to design multimodal interfaces allowing the use of speech and pointing out gestures on a touchscreen. However, present sp...
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
AI
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can co...