Sciweavers

62 search results - page 5 / 13
» Priority queueing systems: from probability generating funct...
Sort
View
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
INFOCOM
2009
IEEE
14 years 2 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
CIKM
2003
Springer
14 years 21 days ago
Queueing analysis of relational operators for continuous data streams
Currently, stream data processing is an active area of research, which includes everything from algorithms and architectures for stream processing to modelling and analysis of var...
Qingchun Jiang, Sharma Chakravarthy
INLG
2010
Springer
13 years 5 months ago
JU_CSE_GREC10: Named Entity Generation at GREC 2010
This paper presents the experiments carried out at Jadavpur University as part of the participation in the GREC Named Entity Generation Challenge 2010. The Baseline system is base...
Amitava Das, Tanik Saikh, Tapabrata Mondal, Sivaji...
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 4 months ago
On the Scaling Law for Compressive Sensing and its Applications
1 minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio...
Weiyu Xu, Ao Tang