Sciweavers

777 search results - page 79 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 8 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
SASO
2007
IEEE
14 years 1 months ago
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
Ankit Patel, Julius Degesys, Radhika Nagpal
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 15 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
PLDI
1998
ACM
13 years 12 months ago
Type-Based Alias Analysis
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by u...
Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss