2498 search results - page 160 / 500 » Data Structures with Unpredictable Timing |
DOLAP
2004
ACM
15 years 3 months ago
2004
ACM
BST Condensed Cube is a fully computed cube that condenses those tuples, which are aggregated from the same single base relation tuple, into one physical tuple. Although it has be...
PAKDD
1998
ACM
15 years 2 months ago
1998
ACM
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
VVS
1996
IEEE
15 years 2 months ago
1996
IEEE
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
MICCAI
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...