Sciweavers

138 search results - page 20 / 28
» Approximated Clustering of Distributed High-Dimensional 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...
IPTPS
2005
Springer
14 years 1 months ago
Clustering in P2P Exchanges and Consequences on Performances
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
Stevens Le-Blond, Jean-Loup Guillaume, Matthieu La...
CSDA
2006
82views more  CSDA 2006»
13 years 7 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
ICPR
2008
IEEE
14 years 8 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios