349 search results - page 21 / 70 » Semiring-Based Soft Constraints |
205
click to vote
CP
2011
Springer
14 years 5 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
210
click to vote
JMLR
2012
13 years 8 months ago
2012
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
145
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
149
click to vote
CSCLP
2003
Springer
15 years 11 months ago
2003
Springer
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Stefano Bi...
152
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...