Sciweavers

5356 search results - page 953 / 1072
» Adventures in time and space
Sort
View
ICPP
2000
IEEE
15 years 5 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
SSDBM
2000
IEEE
149views Database» more  SSDBM 2000»
15 years 5 months ago
Coordinating Simultaneous Caching of File Bundles from Tertiary Storage
In a previous paper [Shoshani et al 99], we described a system called STACS (Storage Access Coordination System) for High Energy and Physics (HEP) experiments. These experiments g...
Arie Shoshani, Alex Sim, Luis M. Bernardo, Henrik ...
NPIV
1999
ACM
142views Visualization» more  NPIV 1999»
15 years 5 months ago
ALMOST: Exploring Program Traces
We built a tool to visualize and explore program execution traces. Our goal was to help programmers without any prior knowledge of a program, quickly get enough knowledge about it...
Manos Reniers, Steven P. Reis
SRDS
1999
IEEE
15 years 5 months ago
Logging and Recovery in Adaptive Software Distributed Shared Memory Systems
Software distributed shared memory (DSM) improves the programmability of message-passing machines and workclusters by providing a shared memory abstract (i.e., a coherent global a...
Angkul Kongmunvattana, Nian-Feng Tzeng
IPPS
1998
IEEE
15 years 5 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera