Sciweavers

265 search results - page 36 / 53
» Approximation algorithms for clustering uncertain data
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
PAMI
2010
119views more  PAMI 2010»
13 years 6 months ago
Efficient Multilevel Eigensolvers with Applications to Data Analysis Tasks
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
Dan Kushnir, Meirav Galun, Achi Brandt
NN
2006
Springer
113views Neural Networks» more  NN 2006»
13 years 7 months ago
Large-scale data exploration with the hierarchically growing hyperbolic SOM
We introduce the Hierarchically Growing Hyperbolic Self-Organizing Map (H2 SOM) featuring two extensions of the HSOM (hyperbolic SOM): (i) a hierarchically growing variant that al...
Jörg Ontrup, Helge Ritter
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
13 years 9 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu