Sciweavers

2957 search results - page 521 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
TON
1998
145views more  TON 1998»
13 years 7 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Structure-Aware Stochastic Control for Transmission Scheduling
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
Fangwen Fu, Mihaela van der Schaar
PE
2007
Springer
97views Optimization» more  PE 2007»
13 years 7 months ago
On processor sharing and its applications to cellular data network provisioning
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...
Yujing Wu, Carey L. Williamson, Jingxiang Luo
TIP
2008
195views more  TIP 2008»
13 years 7 months ago
Image Coding Using Dual-Tree Discrete Wavelet Transform
In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. Three methods for sp...
Jingyu Yang, Yao Wang, Wenli Xu, Qionghai Dai
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 6 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...