We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
Local bundle adjustment (LBA) has recently been introduced
to estimate the geometry of image sequences taken by
a calibrated camera. Its advantage over standard (global)
bundle ...
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
Jason Meltzer, Ming-Hsuan Yang, Rakesh Gupta, Stef...
We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3– D reconstructions from monocular sequences. We formulate the trac...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...