126 search results - page 12 / 26 » Error bounds for correlation clustering |
113
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
VISUALIZATION
2000
IEEE
15 years 3 months ago
2000
IEEE
We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different...
102
click to vote
CAIP
2009
Springer
15 years 3 months ago
2009
Springer
Recently, performance prediction has been successfully applied in the field of information retrieval for content analysis and retrieval tasks. This paper discusses how performance ...
107
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
102
click to vote
KDD
2001
ACM
15 years 11 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...