Sciweavers

10608 search results - page 175 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
IWPEC
2009
Springer
14 years 5 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
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 ...
Dániel Marx, Ildikó Schlotter
IWPEC
2009
Springer
14 years 5 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
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...
Peter Damaschke
ICPR
2008
IEEE
14 years 4 months ago
Extraction of complex wavelet features for iris recognition
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...
XiaoFu He, Pengfei Shi
ICC
2007
IEEE
147views Communications» more  ICC 2007»
14 years 4 months ago
QAM Codebooks for Low-Complexity Limited Feedback MIMO Beamforming
— This paper proposes a new QAM based codebook for beamforming in multiple-input multiple-output (MIMO) wireless systems with a limited-rate feedback channel. We show that such c...
Daniel J. Ryan, I. Vaughan, L. Clarkson, Iain B. C...
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 4 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod