Ray tracing is an inherent part of photorealistic image synthesis algorithms. The problem of
ray tracing is to find the nearest intersection with a given ray and scene. Although this …

We propose a new massively parallel algorithm for constructing high-quality bounding
volume hierarchies (BVHs) for ray tracing. The algorithm is based on modifying an existing …

Until recently, parallel programming has largely focused on the exploitation of data-
parallelism in dense matrix programs. However, many important application domains …

This paper presents an efficient technique to reduce the inference cost of deep and/or wide
convolutional neural network models by pruning redundant features (or filters). Previous …

This paper proposes a new and efficient technique to regularize the neural network in the
context of deep learning using correlations among features. Previous studies have shown …

Irregular programs are programs organized around pointer-based data structures such as
trees and graphs. Recent investigations by the Galois project have shown that many …

With better and faster acquisition devices comes a demand for fast robust reconstruction
algorithms, but no L1-based technique has been fast enough for online use so far. In this …

Traditionally, effects that require evaluating multidimensional integrals for each pixel, such
as motion blur, depth of field, and soft shadows, suffer from noise due to the variance of the …

We introduce Approximate Agglomerative Clustering (AAC), an efficient, easily
parallelizable algorithm for generating high-quality bounding volume hierarchies using …

This paper presents an efficient technique to prune deep and/or wide convolutional neural
network models by eliminating redundant features (or filters). Previous studies have shown …