297 search results - page 24 / 60 » Heap Reference Analysis Using Access Graphs |
107
click to vote
ICPPW
2005
IEEE
15 years 8 months ago
2005
IEEE
Grid enabled physics analysis requires a Workload Management System (WMS) that takes care of finding suitable computing resources to execute data intensive jobs. A typical exampl...
231
click to vote
MICRO
2000
IEEE
15 years 2 months ago
2000
IEEE
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
113
click to vote
IFIP12
2007
15 years 3 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
154
click to vote
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-rela...
115
click to vote
ICCSA
2010
Springer
15 years 9 months ago
2010
Springer
This paper proposes a three-stage analysis of web navigation that yields search results being relevant to the user’s interests and preferences. The approach is inspired by ant fo...