32545 search results - page 95 / 6509 » Data Structures and Algorithms |
136
Voted
PLDI
2011
ACM
14 years 5 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in āregularā...
146
Voted
VMV
2001
15 years 4 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
107
Voted
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
141
Voted
EUROPAR
2003
Springer
15 years 7 months ago
2003
Springer
This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Reļ¬nement (SAMR) applic...
111
Voted
DATAMINE
1999
15 years 2 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...