Sciweavers

4171 search results - page 179 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 6 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
HAPTICS
2009
IEEE
15 years 9 months ago
The impact of feedback design in haptic volume visualization
Enhancing volume visualization with additional cues from our sense of touch has shown the potential to increase both speed and accuracy in the data exploration. Research in the ar...
Karljohan E. Lundin Palmerius, Camilla Forsell
EUROPAR
2001
Springer
15 years 11 months ago
Experiments in Parallel Clustering with DBSCAN
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
Domenica Arlia, Massimo Coppola
IPPS
2007
IEEE
16 years 23 days ago
Storage Optimization for Large-Scale Distributed Stream Processing Systems
We consider storage in an extremely large-scale distributed computer system designed for stream processing applications. In such systems, incoming data and intermediate results ma...
Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Phili...
DEBU
2010
128views more  DEBU 2010»
15 years 3 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...