13603 search results - page 232 / 2721 » On the Complexity of Computing Treelength |
134
click to vote
CSR
2009
Springer
16 years 12 days 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 ...
156
click to vote
IWPEC
2009
Springer
16 years 11 days 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 ...
164
click to vote
IWPEC
2009
Springer
16 years 11 days 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...
153
click to vote
ICPR
2008
IEEE
16 years 8 days 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...
136
click to vote
GECCO
2007
Springer
15 years 12 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...