Sciweavers

50 search results - page 2 / 10
» Analysis of Basis Pursuit Via Capacity Sets
Sort
View
ISW
2005
Springer
13 years 10 months ago
New Constructive Approach to Covert Channel Modeling and Channel Capacity Estimation
In this paper, we examine general mechanisms that a covert channel may exploit and derive new minimum requirements for setting up a covert channel. We also propose a new classifica...
Zhenghong Wang, Ruby B. Lee
INFOCOM
2008
IEEE
13 years 11 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
ICASSP
2011
IEEE
12 years 9 months ago
Theoretical analysis of musical noise in Wiener filtering family via higher-order statistics
Recently, one of the authors has reported that the amount of generated musical noise is strongly correlated with higher-order statistics of the power spectra. On the basis of this...
Takayuki Inoue, Hiroshi Saruwatari, Kiyohiro Shika...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 5 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
AAAI
2000
13 years 6 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith