1 citations · 3 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 1 cited
DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries
Joshua Engels, Benjamin Coleman, Vihan Lakshman +1
We study the problem of with . This task is analogous to traditional near-neighbor search, with the exception that both th…
cs.DS2021★ 1 cited
Practical Near Neighbor Search via Group Testing
Joshua Engels, Benjamin Coleman, Anshumali Shrivastava
We present a new algorithm for the approximate near neighbor problem that combines classical ideas from group testing with locality-sensitive hashing (LSH). We reduce the near neig…