905 search results - page 4 / 181 » On the Complexity of uSPR Distance |
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We present an image segmentation technique using the morphological Waterfall algorithm. Improvements in the segmentation are brought about by using improved gradients. Th...
IANDC
2007
13 years 7 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
DAM
2006
13 years 7 months ago
2006
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
TCOM
2010
13 years 2 months ago
2010
The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issu...