– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
Subspace identification has proven useful when identifying identifying multi-input multi-output systems. It is, however, important in many applications to take a priori structural ...
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
The state of the art for solving the phase retrieval problem in two dimensions relies heavily on the algorithms proposed by Gerchberg, Saxton, and Fienup. Despite the widespread u...
Heinz H. Bauschke, Patrick L. Combettes, D. Russel...