1236 search results - page 240 / 248 » fast 2010 |
100
click to vote
EGH
2010
Springer
14 years 7 months ago
2010
Springer
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...
EGH
2010
Springer
14 years 7 months ago
2010
Springer
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...
104
click to vote
GIS
2010
ACM
14 years 7 months ago
2010
ACM
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...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
140
click to vote
ICPADS
2010
IEEE
14 years 7 months ago
2010
IEEE
Counting or estimating the number of tags is crucial for RFID system. Researchers have proposed several fast cardinality estimation schemes to estimate the quantity of a batch of ...