Short string signatures, September 2000. DIMACS Workshop on Sublinear Algorithms in Princeton, NJ.

When communication between two parties is the resource, sublinearity is vital to improve on the trivial solution of one party sending their data wholesale to the other. In the particular case of approximating distances between strings, sublinear ”signatures” can be efficiently computed and exchanged. These signatures have applications beyoned communication scenarios, in particular in approximate nearest neighbor algorithms.

bib | http | .pdf ] Back

This file was generated by bibtex2html 1.92.