Sciweavers

CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
13 years 11 months ago
Online Approximate Matching with Non-local Distances
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 ...
Raphaël Clifford, Benjamin Sach