280 search results - page 15 / 56 » New Algorithms for Enumerating All Maximal Cliques |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
RTS
2006
14 years 9 months ago
2006
Abstract. The Time-Triggered Architecture, as architecture for safety-critical realtime applications, incorporates fault-tolerance mechanisms to ensure correct system operation des...
ISCC
2002
IEEE
15 years 2 months ago
2002
IEEE
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...