Sciweavers

1090 search results - page 66 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
14 years 3 months ago
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions
— A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi pa...
Magnus Lindhé, Petter Ögren, Karl Henr...
ICNP
1998
IEEE
14 years 2 months ago
A Class of End-to-End Congestion Control Algorithms for the Internet
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
S. Jamaloddin Golestani, S. Bhattacharyya
COLOGNETWENTE
2009
13 years 11 months ago
Colored Trees in Edge-Colored Graphs
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
ICPR
2004
IEEE
14 years 11 months ago
Reconstructing a Dynamic Surface from Video Sequences Using Graph Cuts in 4D Space-Time
This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...
Narendra Ahuja, Ning Xu, Tianli Yu
PAMI
2010
112views more  PAMI 2010»
13 years 8 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum