670 search results - page 9 / 134 » Intractability and clustering with constraints |
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
90
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
ICML
2007
IEEE
15 years 10 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...
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
— Constrained clustering (semi-supervised learning) techniques have attracted more attention in recent years. However, the commonly used constraints are restricted to the instanc...