Sciweavers

279 search results - page 18 / 56
» Type-II Optimal Polynomial Bases
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 2 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 3 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
TCOM
2008
81views more  TCOM 2008»
13 years 8 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
KR
2010
Springer
14 years 1 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
IPCCC
2007
IEEE
14 years 3 months ago
On Network Coding Based Multirate Video Streaming in Directed Networks
This paper focuses on network coding based multirate multimedia streaming in directed networks and aims at maximizing the total layers received by all receivers, which directly de...
Chen-guang Xu, Yinlong Xu, Cheng Zhan, Ruizhe Wu, ...