Group Testing for Accurate and Efficient Range-Based Near Neighbor Search for Plagiarism Detection

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Shah, Harsh, Mittal, Kashish, Rajwade, Ajit
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms Computer Vision and Pattern Recognition
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
di: Lu, Kejing, et al.
Pubblicazione: (2024)

On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU
di: Oguri, Yutaro, et al.
Pubblicazione: (2025)

A Joint Sparse Self-Representation Learning Method for Multiview Clustering
di: Jia, Mengxue, et al.
Pubblicazione: (2025)

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm
di: Mikkelstrup, Christian Møller, et al.
Pubblicazione: (2026)

Fast Isotropic Median Filtering
di: Weiss, Ben
Pubblicazione: (2025)

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs
di: Ootomo, Hiroyuki, et al.
Pubblicazione: (2023)

Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
di: Oliveira, P. A. M., et al.
Pubblicazione: (2016)

Hadamard Row-Wise Generation Algorithm
di: Monroy, Brayan, et al.
Pubblicazione: (2024)

A Unified Framework for Integer Programming Formulation of Graph Matching Problems
di: Alidaee, Bahram, et al.
Pubblicazione: (2024)

Learning Tree-Structured Composition of Data Augmentation
di: Li, Dongyue, et al.
Pubblicazione: (2024)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
di: Wang, Jiachen T., et al.
Pubblicazione: (2024)

Probabilistic Kernel Function for Fast Angle Testing
di: Lu, Kejing, et al.
Pubblicazione: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
di: Andoni, Alexandr, et al.
Pubblicazione: (2026)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
di: Liang, Anqi, et al.
Pubblicazione: (2024)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
di: McCauley, Samuel
Pubblicazione: (2024)

Communication-Efficient Federated Learning via Regularized Sparse Random Networks
di: Mestoukirdi, Mohamad, et al.
Pubblicazione: (2023)

Graph-Based Nearest-Neighbor Search without the Spread
di: Giliberti, Jeff, et al.
Pubblicazione: (2026)

Choosing Public Datasets for Private Machine Learning via Gradient Subspace Distance
di: Gu, Xin, et al.
Pubblicazione: (2023)

Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
di: Yavlovich, Ilay, et al.
Pubblicazione: (2026)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
di: Xu, Yuexuan, et al.
Pubblicazione: (2024)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
di: Ma, Xinran, et al.
Pubblicazione: (2025)

A General Framework for Low Soundness Homomorphism Testing
di: Mittal, Tushant, et al.
Pubblicazione: (2025)

Towards Efficient Data Structures for Approximate Search with Range Queries
di: Kian, Ladan, et al.
Pubblicazione: (2026)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
di: Khanna, Sanjeev, et al.
Pubblicazione: (2025)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
di: Li, Binhong, et al.
Pubblicazione: (2025)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
di: Al-Jazzazi, Yousef, et al.
Pubblicazione: (2025)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
di: Yu, Shangdi, et al.
Pubblicazione: (2023)

Retroactive Monotonic Priority Queues via Range Searching
di: Castro, Lucas, et al.
Pubblicazione: (2025)

TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges
di: Qiu, Ruizhong, et al.
Pubblicazione: (2025)

The Central Spanning Tree Problem
di: Sanmartín, Enrique Fita, et al.
Pubblicazione: (2024)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
di: Krauthgamer, Robert, et al.
Pubblicazione: (2026)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
di: Dehghankar, Mohsen, et al.
Pubblicazione: (2025)

Adversarially Robust Approximate Furthest Neighbor
di: Banihashem, Kiarash, et al.
Pubblicazione: (2026)

A Query-Driven Approach to Space-Efficient Range Searching
di: Fotakis, Dimitris, et al.
Pubblicazione: (2025)

Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions
di: Black, Hadley
Pubblicazione: (2023)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
di: Zhang, Tian, et al.
Pubblicazione: (2026)

Testing Calibration in Nearly-Linear Time
di: Hu, Lunjia, et al.
Pubblicazione: (2024)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
di: Iacono, John, et al.
Pubblicazione: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
di: Herold, Martin G., et al.
Pubblicazione: (2025)

Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices
di: Ganbarov, Ali, et al.
Pubblicazione: (2024)