1272 search results - page 69 / 255 » Approximate Parameterized Matching |
ASIAN
1998
Springer
15 years 3 months ago
1998
Springer
call it, provides abstraction through the rewriting arrow and explicit rule application. It also embeds the notion of sets of results to deal with non-deterministic computations. F...
PSIVT
2009
Springer
15 years 3 months ago
2009
Springer
This paper approximates ground truth for real-world stereo sequences and demonstrates its use for the performance analysis of a few selected stereo matching and optical flow techn...
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
105
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
117
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...