492 search results - page 63 / 99 » XML graphs in program analysis |
126
click to vote
PVLDB
2010
14 years 8 months ago
2010
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
132
click to vote
VIZSEC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
147
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
121
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...