11 papers
Dynamic Necklace Splitting
Rishi Advani, Abolfazl Asudeh, Mohsen Dehghankar +1
The necklace splitting problem is a classic problem in fair division with many applications, including data-informed fair hash maps. We extend necklace splitting to a dynamic setti…
Random-Access Ranked Retrieval and Similarity Search
Mohsen Dehghankar, Abolfazl Asudeh, Raghav Mittal +2
We extend Random Access, a fundamental operation that enables efficient search and exploration algorithms, to the modern interactive data systems based on Ranked Retrieval and Simi…
Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache
Mohsen Dehghankar, Abolfazl Asudeh
Sparse attention improves LLM inference efficiency by selecting a subset of key-value entries, but at the cost of potential accuracy degradation. In particular, omitting critical K…
NeedleDB: A Generative-AI Based System for Accurate and Efficient Image Retrieval using Complex Natural Language Queries
Mahdi Erfanian, Abolfazl Asudeh
We demonstrate NeedleDB, an open-source, deployment-ready database system for answering complex natural language queries over image data. Unlike existing approaches that rely on co…
RSR-core: A High-Performance Engine for Low-Bit Matrix-Vector Multiplication
Mohsen Dehghankar, Abolfazl Asudeh
Matrix-vector multiplication is a fundamental building block in neural networks, vector databases, and large language models, particularly during inference. As a result, efficient…
On Fair Epsilon Net and Geometric Hitting Set
Mohsen Dehghankar, Stavros Sintos, Abolfazl Asudeh
Fairness has emerged as a formidable challenge in data-driven decisions. Many of the data problems, such as creating compact data summaries for approximate query processing, can be…