1227 search results - page 121 / 246 » Approximate Kernel Clustering |
147
click to vote
PAMI
2011
14 years 11 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
139
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
147
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
241
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
163
click to vote
IAT
2009
IEEE
15 years 11 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....