We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
In this paper, we present a new segmentation-based 2D mosaic framework. Most of current mosaic algorithms do not explicitly remove moving objects from images before registration, ...
Coordinating multiple overlapping defense mechat differing levels of abstraction, is fraught with the potential for misconfiguration, so there is strong motivation to generate p...
Paul Rubel, Michael Ihde, Steven Harp, Charles Pay...
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
Recent work has shown that the probabilistic SLAM approach of explicit uncertainty propagation can succeed in permitting repeatable 3D real-time localization and mapping even in th...
Javier Civera, Andrew J. Davison, J. M. M. Montiel