5595 search results - page 371 / 1119 » Approximation Algorithms for Clustering Problems |
156
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
163
click to vote
IJCAI
2003
15 years 8 months ago
2003
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...
167
click to vote
ICCD
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract— In this paper we consider the problem of clustering sequential circuits subject to a bound on the area of each cluster, with the objective of minimizing the clock perio...
216
click to vote
ECML
2005
Springer
15 years 8 months ago
2005
Springer
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
211
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...