14699 search results - page 329 / 2940 » Complexity and Cognitive Computing |
125
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
143
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
172
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
172
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
171
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a new feature extraction method for iris recognition. Since two dimensional complex wavelet transform (2D-CWT) does not only keep wavelet transform’s propert...