2654 search results - page 346 / 531 » On Pairing Inversion Problems |
154
Voted
MP
1998
15 years 4 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
151
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
175
click to vote
CVPR
1996
IEEE
16 years 7 months ago
1996
IEEE
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...
159
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
122
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper considers the problem of reconstructing visually realistic 3D models of fire from a very small set of simultaneous views (even two). By modeling fire as a semi-transpar...