We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problem...
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
We present the two-user Responsive Workbench: a projectionbased virtual reality system that allows two people to simultaneously view individual stereoscopic image pairs from their...
Maneesh Agrawala, Andrew C. Beers, Ian McDowall, B...
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
Abstract. The incorporation of additional user knowledge into a nonrigid registration process is a promising topic in modern registration schemes. The combination of intensity base...
Nils Papenberg, Janine Olesch, Thomas Lange, Peter...