1272 search results - page 48 / 255 » Approximate Parameterized Matching |
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
WDAG
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
ESA
2003
Springer
15 years 4 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
108
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
DEBU
2000
14 years 11 months ago
2000
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world ...