Sciweavers

527 search results - page 15 / 106
» Implementation of Approximation Algorithms for the Multicast...
Sort
View
COR
2006
122views more  COR 2006»
13 years 8 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
14 years 2 months ago
An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van ...
TCSV
2002
69views more  TCSV 2002»
13 years 8 months ago
Optimizing channel allocation in a unified video-on-demand system
Unified video-on-demand (UVoD) is a recently proposed architecture that integrates multicast transmission with unicast transmission to improve system efficiency. Streaming channels...
Jack Y. B. Lee
INFOCOM
2000
IEEE
14 years 24 days ago
CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation
Abstract—We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link...
Rong Pan, Balaji Prabhakar, Konstantinos Psounis
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...