Disney Research Boston

In this paper, we first rigorously compare the two algorithms and in the process develop several extensions, including a version of EBP for continuous regression problems and a PBP variant for binary classification.

We present a method to automatically convert videos and CG animations to stylized animated line-drawings.

We present AutoConnect, an automatic method that creates customized, 3D-printable connectors attaching two physical objects together.

We address the problem of planning collision-free paths for multiple agents using optimization methods known as proximal algorithms.

In this paper, we consider optimization as an approach for quickly and flexibly developing hybrid cognitive capabilities that are efficient, scalable, and can exploit task knowledge to improve solution speed and quality.

We describe a new instance-based learning algorithm called the Boundary Forest (BF) algorithm, that can be used for supervised and unsupervised learning. The algorithm builds a forest of trees whose nodes store previously seen examples.

In this paper, we consider optimization as an approach for quickly and flexibly developing hybrid cognitive capabilities that are efficient, scalable, and can exploit knowledge to improve solution speed and quality.

We describe how the powerful “Divide and Concur” algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers (ADMM) algorithm for convex optimization, and introduce an improved message-passing algorithm based on ADMM/DC by introducing three distinct weights for messages, with “certain” and “no opinion” weights, as well as the standard weight used in ADMM/DC.

We describe a novel approach for computing collision-free global trajectories for p agents with specified initial and final configurations, based on an improved version of the alternating direction method of multipliers (ADMM) algorithm. Compared with existing methods, our approach is naturally parallelizable and allows for incorporating different cost functionals with only minor adjustments.

We present a method for transforming a 3D object into a cube or a box using a continuous folding sequence.