1871 search results - page 198 / 375 » The Ephemeral Pairing Problem |
193
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
188
Voted
MP
1998
15 years 6 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...
173
click to vote
STOC
2009
ACM
16 years 7 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,...
208
click to vote
CVPR
1996
IEEE
16 years 8 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...
189
click to vote
CVPR
2005
IEEE
16 years 8 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...