1091 search results - page 48 / 219 » Approximation Algorithms for Data Placement Problems |
136
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
179
click to vote
CORR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
130
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
120
click to vote
HICSS
2008
IEEE
15 years 8 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
105
click to vote
ICTAI
2006
IEEE
15 years 8 months ago
2006
IEEE
Mean shift based feature space analysis has been shown to be an elegant, accurate and robust technique. The elegance in this non-parametric algorithm is mainly due to its simplici...