681 search results - page 13 / 137 » General Polynomial Time Decomposition Algorithms |
102
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
103
click to vote
TASLP
2011
14 years 6 months ago
2011
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
113
click to vote
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...