5595 search results - page 488 / 1119 » Approximation Algorithms for Clustering Problems |
143
Voted
SIAMDM
2010
15 years 2 months ago
2010
Let A be a 0/1 matrix of size m
199
click to vote
WEA
2005
Springer
16 years 1 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
190
Voted
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
203
Voted
IMR
2004
Springer
16 years 1 months ago
2004
Springer
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
233
Voted
KDD
2008
ACM
16 years 8 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...