Results 81 to 90 of about 70,489 (181)
Self-organizing binary encoding for Approximate Nearest Neighbor search
2016 24th European Signal Processing Conference (EUSIPCO), 2016 Approximate Nearest Neighbor (ANN) search for indexing and retrieval has become very popular with the recent growth of the databases in both size and dimension. In this paper, we propose a novel method for fast approximate distance calculation among the compressed samples.
Ozan, Ezgi Can +3 more
openaire +2 more sources
P-HNSW: Crash-Consistent HNSW for Vector Databases on Persistent Memory
Applied SciencesThe rapid growth of Large Language Models (LLMs) has generated massive amounts of high-dimensional feature vectors extracted from diverse datasets. Efficient storage and retrieval of such data are critical for enabling accurate and fast query responses ...
Haena Lee +3 more
doaj +1 more source
Terminal Embeddings in Sublinear Time [PDF]
TheoretiCSRecently (Elkin, Filtser, Neiman 2017) introduced the concept of a {\it terminal embedding} from one metric space $(X,d_X)$ to another $(Y,d_Y)$ with a set of designated terminals $T\subset X$. Such an embedding $f$ is said to have distortion $\rho\ge 1$
Yeshwanth Cherapanamjeri, Jelani Nelson
doaj +1 more source
kANNolo: Sweet and Smooth Approximate k-Nearest Neighbors Search
7 pages, 3 ...
Leonardo Delfino +5 more
openaire +2 more sources
Song Intersection By Approximate Nearest Neighbor Search.
, 2006 [TODO] Add abstract here.
Casey, Michael A., Slaney, Malcolm
openaire +1 more source
AlgorithmsThis paper explores the integration of Large Language Models (LLMs) and secure Gen-AI technologies within engineering design and manufacturing, with a focus on improving inventory management, component selection, and recommendation workflows.
Dulana Rupanetti +5 more
doaj +1 more source
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search
, 2019 18 pages, to appear at USENIX Security Symposium ...
Chen, Hao +5 more
openaire +3 more sources
Approximate nearest neighbor hybrid query algorithm based on tolerance factor
大数据Approximate nearest neighbor search (ANNS) is an important technique in the field of computer science for efficient similarity search, enabling fast information retrieval in large-scale datasets.With the increasing demand for high-precision information ...
Guangfu HE +5 more
doaj
Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction
IEEE AccessMulti-cluster query engines are common in production, but routing queries to appropriately-sized clusters remains an unsolved problem. Current approaches like round-robin, hash-based routing, or manual rules waste resources when simple queries land on ...
Mahendran Vasagam +2 more
doaj +1 more source
Approximate Nearest Neighbor Search with Window Filters
We define and investigate the problem of $\textit{c-approximate window search}$: approximate nearest neighbor search where each point in the dataset has a numeric label, and the goal is to find nearest neighbors to queries within arbitrary label ranges.
Engels, Joshua +4 more
openaire +2 more sources