Sciweavers

3096 search results - page 516 / 620
» The Generalized FITC Approximation
Sort
View
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 10 months ago
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
Sunil Srinivasa, Martin Haenggi
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 10 months ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 10 months ago
Achieving Near-Capacity at Low SNR on a Multiple-Antenna Multiple-User Channel
We analyze the sensitivity of the capacity of a multi-antenna multi-user system to the number of users being served. We show analytically that, for a given desired sum-rate, the e...
Chau Yuen, Bertrand M. Hochwald
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 10 months ago
Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma
Bayesian model averaging, model selection and its approximations such as BIC are generally statistically consistent, but sometimes achieve slower rates of convergence than other m...
Tim van Erven, Peter Grünwald, Steven de Rooi...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 10 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg