1093 search results - page 95 / 219 » Clustering from Constraint Graphs |
143
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
136
Voted
PODS
2002
ACM
16 years 3 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
176
Voted
AMAI
1999
Springer
15 years 3 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
129
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
141
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...