5100 search results - page 348 / 1020 » The Linear Complexity of a Graph |
152
click to vote
RTA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
135
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
165
click to vote
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
186
Voted
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
153
click to vote
CAV
2003
Springer
15 years 10 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...