Search
Search Results
-
Flexible product quantization for fast approximate nearest neighbor search
Product quantization (PQ) is an effective solution to approximate nearest neighbor (ANN) search. The idea of PQ is to decompose the space into...
-
Multiple search operators selection by adaptive probability allocation for fast convergent multitask optimization
Evolutionary multitask optimization (EMTO) has developed fast recently, and many algorithms have emerged that solve several different problems...
-
Learning-based bypass zone search algorithm for fast motion estimation
Video coding has been widely explored by academia and industry in recent years, mainly due to the great popularization of video applications and...
-
Toward fast belief propagation for distributed constraint optimization problems via heuristic search
Belief propagation (BP) approaches, such as Max-sum and its variants, are important methods to solve large-scale Distributed Constraint Optimization...
-
A fast copy-move image forgery detection approach on a reduced search space
This paper proposes an overlap** block-based passive forensic scheme for copy–move forgery detection in digital images that works on a reduced...
-
A better and fast cloud intrusion detection system using improved squirrel search algorithm and modified deep belief network
Utilizing the cloud environment is one of the most preferable option in every information technology (IT) organization for running its business due...
-
Enhanced adaptive threshold algorithm with weighted search points for fast motion estimation
Block matching algorithms play vital role in the success of the video coding standards. A new block matching algorithm is proposed in this...
-
Fast Hubness-Reduced Nearest Neighbor Search for Entity Alignment in Knowledge Graphs
The flexibility of Knowledge Graphs to represent heterogeneous entities and relations of many types is challenging for conventional data integration...
-
A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
We suggest a new non-recursive algorithm for constructing a balanced binary search tree given an array of numbers. The algorithm has O ( N ) time and O (1...
-
Protein Domain Embeddings for Fast and Accurate Similarity Search
Recently developed protein language models have enabled a variety of applications of the protein contextual embeddings. Per-protein representations...
-
Fast Correlated DNA Subsequence Search via Graph-Based Representation
Numerous fields employ correlation-based searches to provide insights about relationships in a database. Herein we propose a correlated DNA...
-
An improvement of spectral clustering algorithm based on fast diffusion search for natural neighbor and affinity propagation
Spectral clustering algorithm has become more popular in data clustering problems in recent years, due to the idea of optimally dividing the graph to...
-
Combining MILP modeling with algebraic bias evaluation for linear mask search: improved fast correlation attacks on SNOW
The Mixed Integer Linear Programming (MILP) technique has been widely applied in the realm of symmetric-key cryptanalysis. In this paper, we propose...
-
Fast spectral analysis for approximate nearest neighbor search
In large-scale machine learning, of central interest is the problem of approximate nearest neighbor (ANN) search, where the goal is to query...
-
Fast Similarity Search in Large-Scale Iris Databases Using High-Dimensional Hashing
Iris recognition is a widely used biometric identification technology that relies on the accurate and efficient matching of iris images. However,...
-
The non-monopolize search (NO): a novel single-based local search optimization algorithm
Several optimization-based population search methods have been proposed; they use various operators that permit exploring the search space. These...
-
Fast Top-k Similar Sequence Search on DNA Databases
Top-k similar sequence search is an essential tool for DNA data management. Given a DNA database, it is a problem to extract k similar DNA sequence...
-
Turbo Scan: Fast Sequential Nearest Neighbor Search in High Dimensions
This paper introduces Turbo Scan (TS), a novel k-nearest neighbor search solution tailored for high-dimensional data and specific workloads where...
-
Optimization-inspired manual architecture design and neural architecture search
Neural architecture has been a research focus in recent years due to its importance in deciding the performance of deep networks. Representative ones...
-
A Fast Search Algorithm for SqueeSAR Distributed Scatterers in the Problem of Calculating Displacement Velocities
AbstractThis paper describes a software implementation of a fast distributed scatterer search algorithm for the problem of displacement velocity...
