Sciweavers

474 search results - page 59 / 95
» Approximation Algorithms for Tensor Clustering
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
COMPGEOM
2011
ACM
12 years 11 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
ICC
2007
IEEE
203views Communications» more  ICC 2007»
14 years 2 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
NIPS
2008
13 years 9 months ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...
ICCV
1999
IEEE
14 years 9 months ago
Stereo Reconstruction from Multiperspective Panoramas
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...
Heung-Yeung Shum, Richard Szeliski