Results 251 to 260 of about 6,986 (292)

A large language model for deriving spectral embeddings for accurate compound identification in mass spectrometry. [PDF]

Commun Chem
Xu Y, Ma Y, Xu W, Yang Z, Ting KM.
europepmc   +1 more source

Public Omics Explorer (POE): Enabling integrative semantic search across GEO omics datasets based on PubMed publications. [PDF]

Comput Struct Biotechnol J
Grigoriadis D, Tsifintaris M, Giannakakis A, Pavlopoulos GA, Perdikopanis N.   +4 more
europepmc   +1 more source

Study on the spatial distribution characteristics and influencing factors of older adult(s) care facilities in Liaoning Province based on POI data. [PDF]

Front Public Health
Sun J, Xue X, Cui Z.
europepmc   +1 more source

Topology-Informed Quasi-Static Motion Planning for Continuum Robots with Contacts. [PDF]

IEEE Robot Autom Lett
Wang Y, Chen Y.
europepmc   +1 more source

Approximate nearest neighbor graph provides fast and efficient embedding with applications for large-scale biological data. [PDF]

NAR Genom Bioinform
Zhao J, Pierre Both J, Konstantinidis KT.   +2 more
europepmc   +1 more source

Fast Approximate Nearest Neighbor Search via k-Diverse Nearest Neighbor Graph

Proceedings of the AAAI Conference on Artificial Intelligence, 2018
Approximate nearest neighbor search is a fundamental problem and has been studied for a few decades. Recently graph-based indexing methods have demonstrated their great efficiency, whose main idea is to construct neighborhood graph offline and perform a greedy search starting from some sampled points of the graph online.
Yan Xiao, Jiafeng Guo, Yanyan Lan, Jun Xu 0001, Xueqi Cheng   +4 more
openaire   +2 more sources

Trinary-Projection Trees for Approximate Nearest Neighbor Search

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
We address the problem of approximate nearest neighbor (ANN) search for visual descriptor indexing. Most spatial partition trees, such as KD trees, VP trees, and so on, follow the hierarchical binary space partitioning framework. The key effort is to design different partition functions (hyperplane or hypersphere) to divide the points so that 1) the ...
Jingdong Wang 0001, Naiyan Wang, You Jia, Jian Li 0015, Gang Zeng, Hongbin Zha, Xian-Sheng Hua 0001   +6 more
openaire   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Projection search for approximate nearest neighbor

2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2016
Many existing approaches to speed up the nearest neighbor search are based on spatial partition trees, which search the nearest neighbor for a query sample by traversing the tree data structure in a guided depth-first manner. However, this search manner is generally observed to find the exact nearest neighbor at a early time, and spend the remaining ...
Cheng Feng, Bo Yang
openaire   +1 more source

Approximate nearest neighbor search on HDD

2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, 2009
Nearest Neighbor (NN) search plays important roles in Computer Vision algorithms. Especially, NN search on immensely large amount of image data set stored on the Internet is getting highlighted. For dealing with such huge data, main memory of a single PC is insufficient.
Noritaka Himei, Toshikazu Wada
openaire   +1 more source

SONG: Approximate Nearest Neighbor Search on GPU

2020 IEEE 36th International Conference on Data Engineering (ICDE), 2020
Approximate nearest neighbor (ANN) searching is a fundamental problem in computer science with numerous applications in (e.g.,) machine learning and data mining. Recent studies show that graph-based ANN methods often outperform other types of ANN algorithms.
Weijie Zhao 0001, Shulong Tan, Ping Li 0001   +2 more
openaire   +1 more source