Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alima Subedi

dblp:423/6352 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0006-5110-4397ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 33% Storage systems · 33% Hardware accelerators and domain-specific architectures · 33%
Computer networks
1 paper
Software-defined and programmable networks · 50% Edge and fog computing · 50%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
approximate nearest neighbor search
1.012026
Performance Evaluation of Approximate Nearest Neighbor Search on NVIDIA BlueField-3 DPU · HPDC 2026
Performance modeling and evaluation
benchmarking
1.012026
Performance Evaluation of Approximate Nearest Neighbor Search on NVIDIA BlueField-3 DPU · HPDC 2026
Hardware accelerators and domain-specific architectures › domain-specific accelerator › data processing accelerator
data processing unit
1.012026
Performance Evaluation of Approximate Nearest Neighbor Search on NVIDIA BlueField-3 DPU · HPDC 2026
Edge and fog computing › mobile edge computing
computation offloading
0.312026
Performance Evaluation of Approximate Nearest Neighbor Search on NVIDIA BlueField-3 DPU · HPDC 2026
Software-defined and programmable networks › programmable network nodes
SmartNIC
0.312026
Performance Evaluation of Approximate Nearest Neighbor Search on NVIDIA BlueField-3 DPU · HPDC 2026

Methods — techniques the papers use, named apart from their topics

benchmarking · 2.0
YearPublicationVenuePosition
2026 Performance Evaluation of Approximate Nearest Neighbor Search on NVIDIA BlueField-3 DPU
abstract
Advanced SmartNICs known as Data Processing Units (DPU) enable in-network data analytics, being equipped with standard processors and accelerators capable of doing custom computation on-NIC. These SmartNICs are advantageous because the host CPU can delegate simpler data analytics tasks, like filtering, to the NIC where the data first arrives. Only data needing further refinement must be passed on to the host CPU. Our benchmarks focus on NVIDIA’s commercially available Bluefield-3 DPU.
Sophia Bhoria, Nathan Tibbetts, Arjun Kirubakaran, Alima Subedi, Satish Puri
HPDC4
2025 PolyMinHash: Efficient Area-Based MinHashing of Polygons for Approximate Nearest Neighbor Search
abstract
Similarity searches are a critical task in data mining. As datasets grow larger, exact nearest neighbor searches quickly become unfeasible, leading to the adoption of approximate nearest neighbor (ANN) searches. ANN has been studied for text data, images, and trajectories. However, there has been little effort to develop ANN systems for polygons in spatial database systems and geographic information systems. We present PolyMinHash, a system for approximate polygon similarity search that adapts MinHashing into a novel 2D polygon-hashing scheme to generate short, similarity-preserving signatures of input polygons. Minhash is generated by counting the number of randomly sampled points needed before the sampled point lands within the polygon's interior area, yielding hash values that preserve area-based Jaccard similarity.
Alima Subedi, Sankalpa Pokharel, Satish Puri
SIGSPATIAL/GIS1