Sciweavers

354 search results - page 5 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
GLOBECOM
2006
IEEE
15 years 5 months ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...
ACTA
2005
104views more  ACTA 2005»
14 years 11 months ago
Optimal recovery schemes in fault tolerant distributed computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
Kamilla Klonowska, Håkan Lennerstad, Lars Lu...
NIPS
2008
15 years 1 months ago
Sparse Signal Recovery Using Markov Random Fields
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
Volkan Cevher, Marco F. Duarte, Chinmay Hegde, Ric...
ICASSP
2011
IEEE
14 years 3 months ago
Bayesian Compressive Sensing for clustered sparse signals
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
Lei Yu, Hong Sun, Jean-Pierre Barbot, Gang Zheng
GECCO
2004
Springer
143views Optimization» more  GECCO 2004»
15 years 5 months ago
Efficient Clustering-Based Genetic Algorithms in Chemical Kinetic Modelling
Two efficient clustering-based genetic algorithms are developed for the optimisation of reaction rate parameters in chemical kinetic modelling. The genetic algorithms employed are ...
Lionel Elliott, Derek B. Ingham, Adrian G. Kyne, N...