Sciweavers

1672 search results - page 92 / 335
» Tightness problems in the plane
Sort
View
TCOM
2010
142views more  TCOM 2010»
13 years 3 months ago
Performance Bounds and Distance Spectra of Variable Length Codes in Turbo/Concatenated Systems
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
Xavier Jaspar, Luc Vandendorpe
INFOCOM
2012
IEEE
11 years 11 months ago
Delay optimal multichannel opportunistic access
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
Shiyao Chen, Lang Tong, Qing Zhao
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 3 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 3 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 3 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman