Sciweavers

638 search results - page 44 / 128
» Track Layouts of Graphs
Sort
View
CVPR
2001
IEEE
15 years 11 months ago
Multi-Object Tracking Using Dynamical Graph Matching
Hwann-Tzong Chen, Horng-Horng Lin, Tyng-Luh Liu
CVPR
1999
IEEE
15 years 2 months ago
Detecting and Tracking Moving Objects for Video Surveillance
We address the problem of detection and tracking of moving objects in a video stream obtained from a moving airborne platform. The proposed method relies on a graph representation...
Isaac Cohen, Gérard G. Medioni
GD
2007
Springer
15 years 3 months ago
Drawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
Lev Nachmanson, George G. Robertson, Bongshin Lee
JPDC
2006
134views more  JPDC 2006»
14 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
VLC
2002
93views more  VLC 2002»
14 years 9 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase