Results 281 to 290 of about 804,628 (319)
Some of the next articles are maybe not open access.
From the Sup-Decomposition to Sequential Decompositions
Journal of Mathematical Imaging and Vision, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronaldo Fumio Hashimoto, Junior Barrera
openaire +1 more source
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing, 2007We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most k if such exists. This algorithm works also for partitioned matroids.
Petr Hlinený, Sang-il Oum
openaire +2 more sources
1989
In this paper we deal with the problem of decomposing finite communtative Q-algebras as a direct product of local Q-algebras. We solve this problem by reducing it to the problem of finding a decomposition of finite algebras over finite field. We will show that it is possible to define a lifting process that allows to reconstruct the answer over the ...
Patrizia M. Gianni +2 more
openaire +2 more sources
In this paper we deal with the problem of decomposing finite communtative Q-algebras as a direct product of local Q-algebras. We solve this problem by reducing it to the problem of finding a decomposition of finite algebras over finite field. We will show that it is possible to define a lifting process that allows to reconstruct the answer over the ...
Patrizia M. Gianni +2 more
openaire +2 more sources
On Characteristic Decomposition and Quasi-characteristic Decomposition
2019In this paper, the concepts of quasi-characteristic pair and quasi-characteristic decomposition are introduced. The former is a pair \((\mathcal {G}, \mathcal {C})\) of a reduced lexicographic Grobner basis \(\mathcal {G}\) and the W-characteristic set \(\mathcal {C}\) which is regular and extracted from \(\mathcal {G}\); the latter is the ...
Rina Dong, Chenqi Mou
openaire +1 more source
N-decomposition and decomposition matrix for automata
Proceedings of the annual conference on - ACM'73, 1973This continues the study on generalized mutiple decomposition allowing 2-way interconnection [1]. Let NeZ+.An automaton M e D, T,F> is an N-automaton iff the set of states D ≤ πSi and each Si e πi (D) where πi is the projection map onto the ith component.
openaire +1 more source
The decomposition of thionitrites
Current Opinion in Chemical Biology, 2002The mechanism of thionitrite decomposition, both in vivo and in vitro, remains unclear. Thionitrite stability is highly variable; it is a complex function of thionitrite structure and environmental condition. Several recent advances clarify the role of unimolecular homlytic decomposition, metal-catalyzed reductive decomposition and higher-order ...
Jonathan S, Stamler, Eric J, Toone
openaire +2 more sources
Decomposition of Nets and Verification in terms of Decomposition
International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06), 2006Decomposition is an important technique in design and verification based on Petri nets. This paper introduces two kinds of decomposition methods in terms of places and transitions, respectively. For each method, the strategy used in this paper is to require such a decomposition to preserve the desirable properties including liveness and boundedness of ...
openaire +1 more source