1115 search results - page 31 / 223 » Separating Shape Graphs |
106
click to vote
SODA
1997
ACM
15 years 4 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...
141
click to vote
PAMI
2006
15 years 2 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...
122
click to vote
ICRA
2002
IEEE
15 years 7 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...
126
click to vote
ICIP
1997
IEEE
16 years 4 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...
124
click to vote
CEC
2007
IEEE
15 years 9 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 ...