297 search results - page 14 / 60 » Heap Reference Analysis Using Access Graphs |
112
click to vote
AAAI
2006
15 years 3 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
127
click to vote
ICDM
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that t...
113
click to vote
SCAM
2002
IEEE
15 years 6 months ago
2002
IEEE
The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses thro...
111
click to vote
SCIA
2009
Springer
15 years 8 months ago
2009
Springer
In the past few years, street-level geoviewers has become a very popular web-application. In this paper, we focus on a first urban concept which has been identified as useful for...
171
click to vote
OOPSLA
2001
Springer
15 years 6 months ago
2001
Springer
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...