1871 search results - page 62 / 375 » The Ephemeral Pairing Problem |
PARELEC
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
SIGGRAPH
1997
ACM
15 years 3 months ago
1997
ACM
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...
102
click to vote
STOC
1992
ACM
15 years 3 months ago
1992
ACM
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 ...
106
click to vote
BILDMED
2009
15 years 8 days ago
2009
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...
IJON
2008
14 years 11 months ago
2008
We consider the problem of convolutive blind source separation of stereo mixtures. This is often tackled using frequency-domain independent component analysis (FDICA), or time-fre...