4117 search results - page 142 / 824 » On the Satisfiability of Complex Constraints |
214
click to vote
LICS
2012
IEEE
13 years 8 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
176
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
175
click to vote
IPM
2008
15 years 6 months ago
2008
This article explores how to develop complex data driven user models that go beyond the bag of words model and topical relevance. We propose to learn from rich user specific info...
146
click to vote
CRYPTO
2004
Springer
15 years 12 months ago
2004
Springer
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
162
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...