Evaluating the performance of optical flow algorithms has been difficult because of the lack of ground-truth data sets for complex scenes. We describe a simple modification to a r...
Ben Galvin, Brendan McCane, Kevin Novins, David Ma...
Abstract. We show that we can e ectively t arbitrarily complex animation models to noisy image data. Our approach is based on leastsquares adjustment using of a set of progressivel...
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
Object-oriented case representations require approaches for similarity assessment that allow to compare two differently structured objects, in particular, objects belonging to diff...