Sciweavers

10146 search results - page 1994 / 2030
» Fast FAST
Sort
View
EGH
2010
Springer
13 years 7 months ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
EGH
2010
Springer
13 years 7 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
GIS
2010
ACM
13 years 7 months ago
Natural neighbor interpolation based grid DEM construction using a GPU
With modern LiDAR technology the amount of topographic data, in the form of massive point clouds, has increased dramatically. One of the most fundamental GIS tasks is to construct...
Alex Beutel, Thomas Mølhave, Pankaj K. Agar...
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 7 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
13 years 7 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
« Prev « First page 1994 / 2030 Last » Next »