247 search results - page 21 / 50 » Scalable propagation-based call graph construction algorithm... |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
ICSE
2003
IEEE-ACM
14 years 7 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
FPGA
2004
ACM
14 years 27 days ago
2004
ACM
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
COMAD
2009
13 years 8 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...