2157 search results - page 427 / 432 » Optimal Fast Hashing |
120
click to vote
EGH
2010
Springer
14 years 9 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...
103
click to vote
MICRO
2010
IEEE
14 years 9 months ago
2010
IEEE
In a modern chip-multiprocessor system, memory is a shared resource among multiple concurrently executing threads. The memory scheduling algorithm should resolve memory contention...
114
click to vote
CAIP
2009
Springer
14 years 9 months ago
2009
Springer
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
103
click to vote
CLUSTER
2009
IEEE
14 years 9 months ago
2009
IEEE
GPUs have recently evolved into very fast parallel co-processors capable of executing general purpose computations extremely efficiently. At the same time, multi-core CPUs evolutio...
115
click to vote
EUROPAR
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...