267 search results - page 6 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
PKDD
1999
Springer
14 years 28 days ago
1999
Springer
A cascade model is a rule induction methodology using levelwise expansion of an itemset lattice, where the explanatory power of a rule set and its constituent rules are quantitativ...
ECEASST
2006
13 years 8 months ago
2006
Abstract. Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars writ...
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
SOCO
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
TPDS
2010
13 years 7 months ago
2010
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...