1951 search results - page 148 / 391 » An algorithm for improving graph partitions |
171
Voted
ISAAC
2000
Springer
15 years 8 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
140
Voted
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
108
Voted
SWAT
1990
Springer
15 years 9 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
147
click to vote
CIVR
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
172
click to vote
CVPR
2009
IEEE
17 years 13 hour ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...