7 citations · 29 across the 31 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
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…
cs.DS2017
Odd Multiway Cut in Directed Acyclic Graphs
Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of nonter…