258 citations · 935 across the 92 of their papers we have counts for
19 papers · 1 filter
Algorithmic Foundations of Inexact Computing
John Augustine, Dror Fried, Krishna V. Palem +2
Inexact computing also referred to as approximate computing is a style of designing algorithms and computing systems wherein the accuracy of correctness of algorithms executing on…
CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
Benjamin Coleman, David Torres Ramos, Vihan Lakshman +2
Lookup tables are a fundamental structure in many data processing and systems applications. Examples include tokenized text in NLP, quantized embedding collections in recommendatio…
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…
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…
Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing
Anshumali Shrivastava, Zhao Song, Zhaozhuo Xu
We present the first provable Least-Squares Value Iteration (LSVI) algorithms that have runtime complexity sublinear in the number of actions. We formulate the value function estim…
Graph Reordering for Cache-Efficient Near Neighbor Search
Benjamin Coleman, Santiago Segarra, Anshumali Shrivastava +1
Graph search is one of the most successful algorithmic trends in near neighbor search. Several of the most popular and empirically successful algorithms are, at their core, a simpl…