1381 search results - page 50 / 277 » Computational Complexity of Constraint Satisfaction |
132
click to vote
EXPCS
2007
15 years 7 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
190
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
131
click to vote
CONSTRAINTS
2008
15 years 3 months ago
2008
Camera control techniques for Interactive Digital Entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to a...
135
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
127
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...