Fast Search Using <i>k</i>-<i>d</i> Trees with Fine Search for Spectral Data Identification
Spectral identification is an essential technology in various spectroscopic applications, often requiring large spectral databases. However, the reliance on large databases significantly increases computational complexity. To address this issue, we propose a novel fast search algorithm that substant...
Saved in:
| Main Authors: | YoungJae Son, Tiejun Chen, Sung-June Baek |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-02-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/4/574 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient Top-<i>k</i> Spatial Dataset Search Processing
by: Jie Sun, et al.
Published: (2025-02-01) -
iSeqSearch: incremental protein search for iBlast/iMMSeqs2/iDiamond
by: Hyunwoo Yoo, et al.
Published: (2025-04-01) -
Research and Design on Personalized Mobile Search Agent
by: Zhenwei He, et al.
Published: (2013-05-01) -
Research and Design on Personalized Mobile Search Agent
by: Zhenwei He, et al.
Published: (2013-05-01) -
A method based on clustering fast search for bearing performance degradation assessment
by: ShengWen Zhou, et al.
Published: (2025-05-01)