We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Learning algorithms have enjoyed numerous successes in robotic control tasks. In problems with time-varying dynamics, online learning methods have also proved to be a powerful too...
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
The framework of this paper is the formal specification and proof of applications distributed on symmetric interconnection networks, e.g. the torus or the hypercube. The algorithms...