Improved Sketching Of Hamming Distance
- -
Google Tech Talks June 27, 2007 ABSTRACT We address the problem of sketching the hamming distance of data streams. We develop Fixable Sketches which compare data streams or files and restore the differences between them. Our contribution: For two streams with Humming distance bounded by k we show a sketch of size O(klogn) with O(logn) processi... Read more
0 people like this
- -: Improved Sketching Of Hamming Distance
October 9, 2007 (over 16 years ago)Google Tech Talks June 27, 2007 ABSTRACT We address the problem of sketching the hamming distance of data streams. We develop Fixable Sketches which compare data streams or files and restore the differences between them. Our contribution: For two streams with Humming distance bounded by k we sh...
0 people like this
- -: Hashing Searching Sketching.
October 9, 2007 (over 16 years ago)Google Tech Talks November 20, 2006 ABSTRACT We will see improved results on search using hashing and sketching. Hashing is often analyzed as balls being thrown into bins where you think of the hash items as balls and buckets as bins. By studying variants of the balls and bins processes we obtai...
0 people like this(2 results)