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...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
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...
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...
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...
Shi Hwa Lee, Dae-Sung Cho, Yu-Shin Cho, Sehoon Son...
—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 ...