activity
20192026
most citedSurvey-Wide Asteroid Discovery with a High-Performance Computing Enabled Non-Linear Digital Tracking Framework

2 citations · 3 across the 8 of their papers we have counts for

collaborators

9 papers

cs.DC2026

SOLANET: Distributed Neighbor Graph Construction on GPU-Accelerated Systems

Keita Iwabuchi, Trevor Steil, Benjamin W. Priest +3

Neighbor graphs capture relationships among data points and are widely used in data analytics and AI workloads. Many studies have explored approximate construction methods for sing…

cs.DS2026

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion

Nate Veldt, Thomas Stanley, Benjamin W. Priest +5

We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framewor…

astro-ph.EP2025

Multi-year stacking searches for solar system bodies

Alex Geringer-Sameth, Nathan Golovich, Keita Iwabuchi

Digital tracking detects faint solar system bodies by stacking many images along hypothesized orbits, revealing objects that are undetectable in every individual exposure. Previous…

astro-ph.EP2025★ 2 cited

Survey-Wide Asteroid Discovery with a High-Performance Computing Enabled Non-Linear Digital Tracking Framework

Nathan Golovich, Trevor Steil, Alex Geringer-Sameth +3

Modern astronomical surveys detect asteroids by linking together their appearances across multiple images taken over time. This approach faces limitations in detecting faint astero…

cs.DS2025

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees

Nate Veldt, Thomas Stanley, Benjamin W. Priest +4

Finding a minimum spanning tree (MST) for points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $Ω(…

astro-ph.CO2024

A Scalable Gaussian Process Approach to Shear Mapping with MuyGPs

Gregory Sallaberry, Benjamin W. Priest, Robert Armstrong +4

Analysis of cosmic shear is an integral part of understanding structure growth across cosmic time, which in-turn provides us with information about the nature of dark energy. Conve…

cs.DC2021

Metall: A Persistent Memory Allocator For Data-Centric Analytics

Keita Iwabuchi, Karim Youssef, Kaushik Velusamy +2

Data analytics applications transform raw input data into analytics-specific data structures before performing analytics. Unfortunately, such data ingestion step is often more expe…

cs.DC2021

TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata

Trevor Steil, Tahsin Reza, Keita Iwabuchi +3

Understanding the higher-order interactions within network data is a key objective of network science. Surveys of metadata triangles (or patterned 3-cycles in metadata-enriched gra…

cs.DC2019★ 1 cited

UMap: Enabling Application-driven Optimizations for Page Management

Ivy B. Peng, Marty McFadden, Eric Green +5

Leadership supercomputers feature a diversity of storage, from node-local persistent memory and NVMe SSDs to network-interconnected flash memory and HDD. Memory mapping files on di…