492 search results - page 75 / 99 » Fast data stream algorithms using associative memories |
120
click to vote
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
105
click to vote
CG
2006
Springer
15 years 1 months ago
2006
Springer
We present a combination of techniques for interactive out-of-core visualisation of isosurfaces from large timedependent data sets. We make use of an index tree, computed in a pre...
251
Voted
SDM
2011
SIAM
14 years 4 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
138
click to vote
IJCNN
2000
IEEE
15 years 6 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
115
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...