23 citations · 74 across the 22 of their papers we have counts for
4 papers · 2 filters
Lattice-based Locality Sensitive Hashing is Optimal
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota +1
Locality sensitive hashing (LSH) was introduced by Indyk and Motwani (STOC `98) to give the first sublinear time algorithm for the c-approximate nearest neighbor (ANN) problem usin…
Longest Alignment with Edits in Data Streams
Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
Analyzing patterns in data streams generated by network traffic, sensor networks, or satellite feeds is a challenge for systems in which the available storage is limited. In additi…
Streaming Periodicity with Mismatches
Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer +1
We study the problem of finding all -periods of a length- string , presented as a data stream. is said to have -period if its prefix of length differs fro…
Streaming for Aibohphobes: Longest Palindrome with Mismatches
Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindromes). Given an integer , a -near-palindrome is a string of Hamming dista…