644 search results - page 2 / 129 » Decomposition Complexity |
WIOPT
2010
IEEE
13 years 4 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
CONCUR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
SIAMMAX
2010
13 years 26 days ago
2010
Abstract. We discuss the notion of irreducible block Schur decomposition of a complex square matrix and show how such a decomposition provides information about singularities in th...
INTERSPEECH
2010
13 years 29 days ago
2010
It was recently shown that complex cepstrum can be effectively used for glottal flow estimation by separating the causal and anticausal components of speech. In order to guarantee...
SKG
2006
IEEE
14 years 4 days ago
2006
IEEE
The paper studies “equality” in XML model decomposition. XML IFD, TFD, AFD and MVD are proposed. According to complexity of these FDs, four XML normal forms are presented. FD ...