5640 search results - page 348 / 1128 » Parallelizing the Data Cube |
175
click to vote
SIBGRAPI
1999
IEEE
15 years 11 months ago
1999
IEEE
Many computer applications are currently using digital video. Recent advances in digital imaging and faster networking infrastructure made this technology very popular, not only fo...
192
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
Rapid increases in computing and communication performance are exacerbating the long-standing problem of performance-limited input/output. Indeed, for many otherwise scalable para...
200
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Over the last decade, Message Passing Interface (MPI) has become a very successful parallel programming environment for distributed memory architectures such as clusters. However, ...
195
click to vote
EGH
2010
Springer
15 years 4 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...
170
click to vote
PDP
2008
IEEE
16 years 1 months ago
2008
IEEE
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...