13603 search results - page 360 / 2721 » On the Computational Complexity of Cut-Reduction |
197
click to vote
IWPEC
2009
Springer
16 years 2 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...
199
click to vote
ICPR
2008
IEEE
16 years 2 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...
166
click to vote
GECCO
2007
Springer
16 years 1 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 ...
194
click to vote
DCC
2006
IEEE
16 years 1 months ago
2006
IEEE
A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the common “forward” coding of wavelet trees from the highest level (lowest resolution), th...
186
click to vote
DCC
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...