4850 search results - page 438 / 970 » Approximate Data Structures with Applications |
196
click to vote
IEEEPACT
1998
IEEE
15 years 12 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
252
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
188
click to vote
VLDB
1994
ACM
15 years 11 months ago
1994
ACM
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
191
click to vote
IQ
2007
15 years 9 months ago
2007
: DQ metadata can be stored in a Metadata Repository (MDR). The structure of the MDR should be carefully defined to ensure a maximum amount of flexibility, generality and ease of u...
263
click to vote
GISCIENCE
2010
Springer
15 years 7 months ago
2010
Springer
The categorization of our environment into feature types is an essential prerequisite for cartography, geographic information retrieval, routing applications, spatial decision supp...