Sciweavers

1331 search results - page 226 / 267
» Complexity bounds for zero-test algorithms
Sort
View
JSAC
2010
135views more  JSAC 2010»
13 years 6 months ago
Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS
—Over the next decades, the Internet will evolve to support increasingly complex mission-critical services such as telerobotically controlled surgery. The world’s first telero...
T. H. Szymanski, D. Gilbert
TASLP
2010
157views more  TASLP 2010»
13 years 2 months ago
HMM-Based Reconstruction of Unreliable Spectrographic Data for Noise Robust Speech Recognition
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
Bengt J. Borgstrom, Abeer Alwan
TIT
2010
115views Education» more  TIT 2010»
13 years 2 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
TIT
2010
128views Education» more  TIT 2010»
13 years 2 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 3 months ago
Stability of the Max-Weight Protocol in Adversarial Wireless Networks
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
Sungsu Lim, Kyomin Jung, Matthew Andrews