Results 51 to 60 of about 70,489 (181)
Quantization to speedup approximate nearest neighbor search
Neural Computing and Applications, 2023 AbstractThe quantization-based approaches not only are the effective methods for solving the problems of approximate nearest neighbor search, but also effectively reduce storage space. However, many quantization-based approaches usually employ fixed nprobes to the search process for each query. This will lead to extra query consumption.
openaire +1 more source
LoSI: Large Scale Location Inference Through FM Signal Integration and Estimation
Big Data Mining and Analytics, 2019 In this paper we present a large scale, passive positioning system that can be used for approximate localization in Global Positioning System (GPS) denied/spoofed environments.
Tathagata Mukherjee +5 more
doaj +1 more source
A Semantic-Preserving Deep Hashing Model for Multi-Label Remote Sensing Image Retrieval
Remote Sensing, 2021 Conventional remote sensing image retrieval (RSIR) systems perform single-label retrieval with a single label to represent the most dominant semantic content for an image.
Qimin Cheng +5 more
doaj +1 more source
Fast Adaptive Approximate Nearest Neighbor Search with Cluster-Shaped Indices
Big Data and Cognitive ComputingIn this study, we propose a novel adaptive algorithm for approximate nearest neighbor (ANN) search, based on the inverted file (IVF) index (cluster-based index) and online query complexity classification.
Vladimir Kazakovtsev +8 more
doaj +1 more source
Efficient Configuration Space Construction and Optimization for Motion Planning
Engineering, 2015 The configuration space is a fundamental concept that is widely used in algorithmic robotics. Many applications in robotics, computer-aided design, and related areas can be reduced to computational problems in terms of configuration spaces. In this paper,
Jia Pan, Dinesh Manocha
doaj +1 more source
Fast Construction of Nets in Low Dimensional Metrics, and Their Applications
, 2005 We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain improved algorithms for the following problems: Approximate nearest ...
Har-Peled, Sariel, Mendel, Manor
core +4 more sources
Approximate nearest neighbor search by cyclic hierarchical product quantization
Signal, Image and Video Processing, 2023 Abstract Vector quantization (VQ) is a widely used Approximate Nearest Neighbor (ANN) search method. By constructing multiple codebooks, VQ can create more codeword vectors with lower memory consumption, enabling the indexing of large-scale database. In recent years, many VQ-based methods have been proposed, but the codeword vectors constructed
Zhi Xu +4 more
openaire +1 more source
Population-Based Algorithm for Solving the Traveling Salesman Problem
Современные информационные технологии и IT-образование, 2021 This article covers the population-based hybrid algorithm for solving the traveling salesman problem. The algorithm is built on two algorithms: the genetic algorithm and the particle swarm algorithm.
Elena Polupanova, Aleksey Polyakov
doaj +1 more source
The Approximate k-List Problem
IACR Transactions on Symmetric Cryptology, 2017 We study a generalization of the k-list problem, also known as the Generalized Birthday problem. In the k-list problem, one starts with k lists of binary vectors and has to find a set of vectors – one from each list – that sum to the all-zero target ...
Leif Both, Alexander May
doaj +1 more source
Asymmetric Deep Supervised Hashing
, 2017 Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many ...
Jiang, Qing-Yuan, Li, Wu-Jun
core +1 more source