Results 151 to 160 of about 70,489 (181)
Some of the next articles are maybe not open access.

Dynamic Range-Filtering Approximate Nearest Neighbor Search

Proceedings of the VLDB Endowment
Range-filtering approximate nearest neighbor search (RFANNS) has gained significant attention recently. Consider a set D of high-dimensional vectors, each associated with a numeric attribute value, e.g., price or timestamp.
Zhencan Peng   +4 more
openaire   +1 more source

Ordinal Constraint Binary Coding for Approximate Nearest Neighbor Search

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2019
Binary code learning, a.k.a. hashing, has been successfully applied to the approximate nearest neighbor search in large-scale image collections. The key challenge lies in reducing the quantization error from the original real-valued feature space to a discrete Hamming space.
Hong Liu   +3 more
openaire   +3 more sources

Adaptive approximate nearest neighbor search for fractal image compression

IEEE Transactions on Image Processing, 2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image subblocks by repeatedly searching a large virtual codebook constructed from the image under compression. One of the most innovative and promising approaches to speed up the encoding is to convert the range-domain block ...
Chong Sze, Tong, Man, Wong
openaire   +2 more sources

Approximate Nearest Neighbor Search with Filters

Approximate nearest neighbor search (ANNS) on high-dimensional vectors is a fundamental primitive used widely for search over neural embeddings of unstructured data. Prior work on ANNS has produced indices which provide fast and accurate search on datasets up to billions of points, but are not well suited to queries restricted to some subset of the ...
openaire   +2 more sources

Efficient Approximate Nearest Neighbor Search on a Raspberry Pi

Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval
Approximate Nearest Neighbors (ANN) search is a core task in Information Retrieval. However, the high computational demands and reliance on expensive infrastructures limit broader contributions to ANN research. Enabling efficient and effective ANN search on low-resource devices would allow researchers in low-income countries to participate in the ANN ...
Silvio Martinico   +3 more
openaire   +2 more sources

New Directions in Approximate Nearest-Neighbor Searching

2019
Approximate nearest-neighbor searching is an important retrieval problem with numerous applications in science and engineering. This problem has been the subject of many research papers spanning decades of work. Recently, a number of dramatic improvements and extensions have been discovered.
openaire   +1 more source

Plant root exudates and rhizosphere bacterial communities shift with neighbor context

Soil Biology and Biochemistry, 2022
Tayler C Ulbrich   +2 more
exaly  

Residual Vector Product Quantization for approximate nearest neighbor search

Expert Systems with Applications, 2023
Lushuai Niu   +6 more
openaire   +1 more source

Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020
Yury Malkov
exaly  

Home - About - Disclaimer - Privacy