435 citations · 1.3k across the 28 of their papers we have counts for
6 papers · 1 filter
Object Localization with a Weakly Supervised CapsNet
Weitang Liu, Emad Barsoum, John D. Owens
Inspired by CapsNet's routing-by-agreement mechanism with its ability to learn object properties, we explore if those properties in turn can determine new properties of the objects…
A Comparative Study on Exact Triangle Counting Algorithms on the GPU
Leyuan Wang, Yangzihao Wang, Carl Yang +1
We implement exact triangle counting in graphs on the GPU using three different methodologies: subgraph matching to a triangle pattern; programmable graph analytics, with a set-int…
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm
Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida +4
We study the problem of decomposing a volume bounded by a smooth surface into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled so…
Scalable Breadth-First Search on a GPU Cluster
Yuechao Pan, Roger Pearce, John D. Owens
On a GPU cluster, the ratio of high computing power to communication bandwidth makes scaling breadth-first search (BFS) on a scale-free graph extremely challenging. By separating h…
Implementing Push-Pull Efficiently in GraphBLAS
Carl Yang, Aydin Buluc, John D. Owens
We factor Beamer's push-pull, also known as direction-optimized breadth-first-search (DOBFS) into 3 separable optimizations, and analyze them for generalizability, asymptotic speed…
Design Principles for Sparse Matrix Multiplication on the GPU
Carl Yang, Aydin Buluc, John D. Owens
We implement two novel algorithms for sparse-matrix dense-matrix multiplication (SpMM) on the GPU. Our algorithms expect the sparse input in the popular compressed-sparse-row (CSR)…