380 search results - page 50 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
DIS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
SSDBM
2010
IEEE
14 years 1 months ago
2010
IEEE
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
COCOA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
TOPLAS
2008
13 years 8 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...