Sciweavers

841 search results - page 52 / 169
» Approximability of Minimum AND-Circuits
Sort
View
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 5 months ago
Asymptotic Moments for Interference Mitigation in Correlated Fading Channels
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
Jakob Hoydis, Mérouane Debbah, Mari Kobayas...
ICASSP
2011
IEEE
13 years 1 months ago
Gaussian mixture modeling for source localization
Exploiting prior knowledge, we use Bayesian estimation to localize a source heard by a fixed sensor network. The method has two main aspects: Firstly, the probability density fun...
John T. Flåm, Joakim Jalden, Saikat Chatterj...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 10 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
IJSNET
2008
125views more  IJSNET 2008»
13 years 10 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
FOCS
2003
IEEE
14 years 3 months ago
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, ...