4009 search results - page 376 / 802 » Clustering on Complex Graphs |
181
click to vote
MICRO
2009
IEEE
16 years 1 months ago
2009
IEEE
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
200
click to vote
TCS
2010
15 years 5 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
200
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
182
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
190
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...