Sciweavers

396 search results - page 45 / 80
» Probabilistic Cluster Unfoldings
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 4 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
ADHOC
2006
116views more  ADHOC 2006»
15 years 4 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
TON
2010
147views more  TON 2010»
15 years 2 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
15 years 10 months ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
15 years 10 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh