823 search results - page 41 / 165 » Brick partitions of graphs |
143
click to vote
CASES
2007
ACM
15 years 10 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
171
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
136
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
209
click to vote
EUROPAR
2004
Springer
15 years 11 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...
131
click to vote
CPAIOR
2007
Springer
16 years 8 days ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...