1272 search results - page 28 / 255 » Approximate Parameterized Matching |
98
Voted
EOR
2006
15 years 3 months ago
2006
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
122
click to vote
CPM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
150
click to vote
AICT
2005
IEEE
15 years 9 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
124
click to vote
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned versi...
133
click to vote
GBRPR
2005
Springer
15 years 9 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...