847 search results - page 13 / 170 » Approximation algorithms for projective clustering |
123
click to vote
JMM2
2007
15 years 2 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
133
click to vote
NN
2002
Springer
15 years 2 months ago
2002
Springer
A new neural network architecture (PART) and the resulting algorithm are proposed to
270
click to vote
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
119
click to vote
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
258
click to vote
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...