Sciweavers

10988 search results - page 241 / 2198
» Algorithmic Folding Complexity
Sort
View
ICC
2007
IEEE
147views Communications» more  ICC 2007»
15 years 10 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...
128
Voted
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
15 years 10 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
GMP
2006
IEEE
114views Solid Modeling» more  GMP 2006»
15 years 10 months ago
A Step Towards Automated Design of Side Actions in Injection Molding of Complex Parts
Side actions contribute to mold cost by resulting in an additional manufacturing and assembly cost as well as by increasing the molding cycle time. Therefore, generating shapes of ...
Ashis Gopal Banerjee, Satyandra K. Gupta
110
Voted
ICMCS
2006
IEEE
153views Multimedia» more  ICMCS 2006»
15 years 10 months ago
Overview of Low-Complexity Video Transcoding from H.263 to H.264
With the standardization of H.264/AVC by ITU-T and ISO/IEC and the adaptatation into new hardware, the necessity of transcoding between existing standards and H.264 will arise to ...
Jens Bialkowski, Marcus Barkowsky, André Ka...
PCM
2005
Springer
117views Multimedia» more  PCM 2005»
15 years 9 months ago
A Robust Text Segmentation Approach in Complex Background Based on Multiple Constraints
In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into ...
Libo Fu, Weiqiang Wang, Yaowen Zhan