1794 search results - page 38 / 359 » Visualizing Memory Graphs |
SGAI
2007
Springer
15 years 8 months ago
2007
Springer
Mining subgraphs is an area of research where we have a given set of graphs, and we search for (connected) subgraphs contained in these graphs. In this paper we focus on the analy...
142
click to vote
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
212
Voted
ICDCN
2011
Springer
14 years 5 months ago
2011
Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...
114
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
98
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...