1554 search results - page 156 / 311 » Parameterized Complexity and Approximation Algorithms |
115
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
116
Voted
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
105
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
131
click to vote
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
126
Voted
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...