Sciweavers

94 search results - page 19 / 19
» Partitions and Clifford algebras
Sort
View
DAM
2010
137views more  DAM 2010»
13 years 4 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
FQ
2003
Springer
13 years 10 months ago
Symplectic Spreads and Permutation Polynomials
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
Simeon Ball, Michael Zieve
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
13 years 10 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ICSM
1999
IEEE
13 years 9 months ago
A Two-Phase Process for Software Architecture Improvement
Software architecture is important for large systems in which it is the main means for, among other things, controlling complexity. Current ideas on software architectures were no...
René L. Krikhaar, André Postma, M. P...