Fast kNN graph construction
This Final Year Project (FYP) report delves into a new Approximate Nearest Neighbor (ANN) searching algorithm, The Dense Graph- Parallel Approximate Nearest Neighbor Search Over Graphs (DG-PANN). It is an innovative enhancement of Parallel Approximate Nearest Neighbor Search Over Graphs (PANN). By l...
Saved in:
Main Author: | Kassim Bin Mohamad Malaysia |
---|---|
Other Authors: | Luo Siqiang |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/175305 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Authenticating kNN query results in data publishing
by: Cheng, W., et al.
Published: (2013) -
ERkNN: Efficient Reverse k-Nearest Neighbors retrieval with local kNN-distance estimation
by: Xia, C., et al.
Published: (2013) -
Scalable kNN search on vertically stored time series
by: Kashyap S., et al.
Published: (2021) -
Continuous monitoring of kNN queries in wireless sensor networks
by: YAO, Yuxia, et al.
Published: (2006) -
Localized Monitoring of kNN Queries in Wireless Sensor Networks
by: YAO, Yuxia, et al.
Published: (2009)