Sciweavers

257 search results - page 45 / 52
» The convexity spectra of graphs
Sort
View
AMFG
2005
IEEE
155views Biometrics» more  AMFG 2005»
14 years 1 months ago
Linear Programming for Matching in Human Body Gesture Recognition
We present a novel human body gesture recognition method using a linear programming based matching scheme. Instead of attempting to segment an object from the background, we develo...
Hao Jiang, Ze-Nian Li, Mark S. Drew
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
14 years 1 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
GD
2005
Springer
14 years 1 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
EMMCVPR
2001
Springer
13 years 12 months ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
LATIN
1998
Springer
13 years 11 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner