Sciweavers

80 search results - page 4 / 16
» A New Approximation Algorithm for Computing 2-Restricted Dis...
Sort
View
INFOCOM
2002
IEEE
14 years 10 days ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 24 days ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
IPL
2008
111views more  IPL 2008»
13 years 7 months ago
Flying over a polyhedral terrain
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
Hamid Zarrabi-Zadeh
ICMLA
2009
13 years 5 months ago
ECON: A Kernel Basis Pursuit Algorithm with Automatic Feature Parameter Tuning, and its Application to Photometric Solids Approx
This paper introduces a new algorithm, namely the EquiCorrelation Network (ECON), to perform supervised classification, and regression. ECON is a kernelized LARS-like algorithm, b...
Manuel Loth, Philippe Preux, Samuel Delepoulle, Ch...
CCCG
2009
13 years 8 months ago
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou