2654 search results - page 157 / 531 » On Pairing Inversion Problems |
174
click to vote
ISAAC
2005
Springer
16 years 1 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
183
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
197
click to vote
BMVC
2002
15 years 10 months ago
2002
The wide-baseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements...
155
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
: In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with...
189
click to vote
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
Digital camera sensors are inherently sensitive to the nearinfrared (NIR) part of the light spectrum. In this paper, we propose a general design for color filter arrays that allow...