40 search results - page 6 / 8 » Combinatorial Laplacian of the Matching Complex |
SODA
1992
ACM
13 years 7 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...
ICESS
2004
Springer
13 years 11 months ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
DISOPT
2010
13 years 5 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
IVC
2007
13 years 5 months ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
IPPS
2008
IEEE
14 years 5 days ago
2008
IEEE
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...