7129 search results - page 284 / 1426 » Approximation Algorithms for Treewidth |
173
Voted
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
132
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
116
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
141
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
154
click to vote
INFOCOM
1998
IEEE
1998
IEEE
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
15 years 8 months ago
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...