4 citations · 4 across the 4 of their papers we have counts for
6 papers
HDLouvain: High-Throughput Incremental Clustering for Hyperdimensional Data
Beenish Gul, Mahbod Afarin, Farhat Ahmed +4
Modern shotgun proteomics generates tens of thousands of tandem mass spectra per hour, producing hundreds of gigabytes of data that strain conventional clustering pipelines. DBSCAN…
Compiling Semi-Ring Dynamic Programming to Tier-Aware 3D-DRAM Processing-in-Memory
Mahbod Afarin, Tsung-Han Lu, Tajana Rosing
Processing-in-Memory (PIM) on monolithic 3D (M3D) DRAM is a promising answer to the memory wall for data-intensive dynamic programming (DP), yet extracting its performance today de…
Compiler-Driven Approximation Tuning for Hyperdimensional Computing
Xavier Routh, Abdul Rafae Noor, Akash Kothari +4
As Moore's law reaches its physical and economic limits, domain-specific approaches are increasingly employed to accelerate machine learning workloads. Hyperdimensional Computing (…
GEN-Graph: Heterogeneous PIM Accelerator for General Computational Patterns in Graph-based Dynamic Programming
Yanru Chen, Runyang Tian, Zheyu Li +3
While graph-based dynamic programming (DP) is a cornerstone of genomics and network analytics, its efficiency is hampered by fundamentally conflicting computational patterns. Matri…
Analysis of Stable Vertex Values: Fast Query Evaluation Over An Evolving Graph
Mahbod Afarin, Chao Gao, Xizhe Yin +3
Evaluating a query over a large, irregular graph is inherently challenging. This challenge intensifies when solving a query over a sequence of snapshots of an evolving graph, where…
Graph Analytics on Evolving Data (Abstract)
Mahbod Afarin, Chao Gao, Shafiur Rahman +2
We consider the problem of graph analytics on evolving graphs. In this scenario, a query typically needs to be applied to different snapshots of the graph over an extended time win…