Sciweavers

518 search results - page 45 / 104
» Beating a Random Assignment
Sort
View
135
Voted
AEI
1999
120views more  AEI 1999»
15 years 2 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy
JCSS
2002
199views more  JCSS 2002»
15 years 2 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
CVPR
2009
IEEE
16 years 9 months ago
Contextual Classification with Functional Max-Margin Markov Networks
We address the problem of label assignment in computer vision: given a novel 3-D or 2-D scene, we wish to assign a unique label to every site (voxel, pixel, superpixel, etc.). To...
Daniel Munoz, James A. Bagnell, Martial Hebert, Ni...
116
Voted
CISS
2008
IEEE
15 years 9 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
144
Voted
COMSWARE
2007
IEEE
15 years 8 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra