1115 search results - page 31 / 223 » Separating Shape Graphs |
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
PAMI
2006
13 years 8 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
ICIP
1997
IEEE
14 years 10 months ago
1997
IEEE
Here we describe a baseline-based binary shape coding method in which arbitrarily shaped object is represented by the traced 1-D data from baseline and turning point (TP). The sha...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Target shape matching can be used as a quick and easy surrogate task when evaluating optimization algorithms intended for computationally expensive tasks, such as turbine blade ...