1493 search results - page 156 / 299 » Local resilience of graphs |
130
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...
137
click to vote
SIBGRAPI
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
163
click to vote
SLS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
147
click to vote
EVOW
2004
Springer
15 years 10 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
172
click to vote
ACPC
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...