1794 search results - page 83 / 359 » Visualizing Memory Graphs |
133
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
169
click to vote
ISSTA
2012
ACM
13 years 6 months ago
2012
ACM
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
121
click to vote
IV
2002
IEEE
15 years 9 months ago
2002
IEEE
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
198
click to vote
DLIB
2002
15 years 3 months ago
2002
In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary gene...
122
click to vote
VLDB
1999
ACM
15 years 8 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...