Sciweavers

2095 search results - page 170 / 419
» Improved pebbling bounds
Sort
View
ICC
2009
IEEE
120views Communications» more  ICC 2009»
15 years 4 months ago
Achieving Exponential Diversity in Wireless Multihop Systems with Regenerative Relays
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
Andreas Müller 0001, Joachim Speidel
JMLR
2010
119views more  JMLR 2010»
15 years 1 months ago
The Group Dantzig Selector
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...
Han Liu, Jian Zhang 0003, Xiaoye Jiang, Jun Liu
ICASSP
2011
IEEE
14 years 10 months ago
Adaptive frequency-domain biased estimation algorithms with automatic adjustment of shrinkage factors
In this work, we propose adaptive frequency-domain biased estimation algorithms with mechanisms to automatically adjust the shrinkage factors. The proposed estimation algorithms i...
Sheng Li, Rodrigo C. de Lamare, Martin Haardt
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 6 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff