1105 search results - page 113 / 221 » Approximate Spectral Clustering. |
103
click to vote
CORR
2006
Springer
15 years 25 days 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 ...
111
click to vote
ESA
2004
Springer
15 years 6 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...
194
Voted
ICDE
2007
IEEE
16 years 2 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 ...
124
Voted
IAT
2009
IEEE
15 years 7 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....
76
Voted
ESANN
2004
15 years 2 months ago
2004
Abstract. In many situations, high dimensional data can be considered as sampled functions. We show in this paper how to implement a Self-Organizing Map (SOM) on such data by appro...