251 search results - page 1 / 51 » Using self-dissimilarity to quantify complexity |
COMPLEXITY
2007
13 years 11 months ago
2007
ICASSP
2008
IEEE
14 years 5 months ago
2008
IEEE
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
JSAT
2006
13 years 11 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
CSCLP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
CSL
2006
Springer
14 years 2 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...