248 search results - page 15 / 50 » New Approximation Algorithms for Minimum Cycle Bases of Grap... |
118
Voted
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
149
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
113
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
150
Voted
NIPS
2007
15 years 5 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
160
Voted
SODA
1992
ACM
15 years 4 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...