267 search results - page 32 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
ICCAD
1999
IEEE
14 years 27 days ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Social Network Analysis (SNA) provides graph algorithms to characterize the structure of social networks, strategic positions in these networks, specific sub-networks and...
SIGMOD
2008
ACM
14 years 8 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. ...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
ICMCS
2009
IEEE
13 years 6 months ago
2009
IEEE
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...