1794 search results - page 88 / 359 » Visualizing Memory Graphs |
304
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
154
Voted
PODS
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
147
click to vote
JPDC
2008
15 years 4 months ago
2008
Cluster computing has become an essential issue for designing immersive visualization systems. This paradigm employs scalable clusters of commodity computers with much lower costs...
135
click to vote
EPIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
110
Voted
ECLIPSE
2004
ACM
15 years 9 months ago
2004
ACM
Information Visualization Toolkits are often in the form of applications or complex frameworks and do not integrate into existing applications very easily. In this paper we introd...