Improved Sketching Of Hamming Distance
From Google TechTalks · 56:29
Show by Google TechTalks
Google Tech TalksJune 27, 2007ABSTRACTWe 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) processing time per new element in the stream and how to restore all locations where the two streams differ in time linear in the sketch size. Probability of error is less then 1/n.Uploaded 08-10-07Speaker: Ely PoratAt age 16 Ely Porat multithreaded being a junior in high school, a freshman in the computer science department of Bar Ilan university and hacking computers....
More episodes of Google TechTalks
More episodes
- Hyperproductive Distributed Scrum Teams
- 360 Video
- Multi-Party Computation: From Theory to Practice
- The Extended Mind: Recent Experimental Evidence
- DSD: A Hybrid Analysis Tool for Bug Finding
- Chasing the Constants and its Implications in Differential Privacy
- Making Great Decisions
- Streaming Private Continual Counting via Binning
- Distributed Testing with SmartFrog
- Differentially Private Synthetic Data without Training
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.