1675 search results - page 184 / 335 » Implementing Data Cubes Efficiently |
131
Voted
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
128
click to vote
ISM
2006
IEEE
15 years 2 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
107
click to vote
CGF
2004
15 years 2 months ago
2004
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
130
Voted
PRESENCE
1998
15 years 2 months ago
1998
We propose an accurate collision detection algorithm for use in virtual reality applications. The algorithm works for three-dimensional graphical environments where multiple objec...
141
Voted
PR
2010
14 years 9 months ago
2010
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...