Sciweavers

5785 search results - page 28 / 1157
» Approximability of Probability Distributions
Sort
View
TIT
2010
137views Education» more  TIT 2010»
14 years 8 months ago
Channel coding rate in the finite blocklength regime
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bou...
Yury Polyanskiy, H. Vincent Poor, Sergio Verd&uacu...
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
14 years 11 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
ICC
2007
IEEE
103views Communications» more  ICC 2007»
15 years 7 months ago
Modeling Channel Occupancy Times for Voice Traffic in Cellular Networks
—Call holding times in telephony networks are commonly approximated by exponential distributions to facilitate traffic engineering. However, for traffic engineering of cellular n...
Emre A. Yavuz, Victor C. M. Leung
INFOCOM
2005
IEEE
15 years 7 months ago
Connection admission control for flow level QoS in bufferless models
Abstract— Admission control algorithms used in access networks for multiplexed voice sources are typically based on aggregated system characteristics, such as aggregate loss prob...
Sándor Rácz, Tamás Jakabfy, J...
TIT
1998
70views more  TIT 1998»
15 years 1 months ago
The Importance of Convexity in Learning with Squared Loss
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...