Given two strings of length n over alphabet Σ, and an upper bound
k on t...
Computing the edit distance of two strings is one of the most basic prob...
In this paper, we generalize the recently studied Stochastic Matching pr...
Motivated by demand-responsive parking pricing systems we consider
poste...
share