1258 search results - page 3 / 252 » Architecture-driven Problem Decomposition |
IPL
2007
13 years 5 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
COMBINATORICA
2010
13 years 18 days ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
CONSTRAINTS
2011
13 years 19 days ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
MMAS
2010
Springer
13 years 11 days ago
2010
Springer
In this paper, we study domain decomposition preconditioners for multiscale flows in high contrast media. Our problems are motivated by porous media applications where low conduct...