120 search results - page 6 / 24 » Low Complexity Algorithms for Linear Recurrences |
TSP
2008
13 years 7 months ago
2008
Abstract-- Linear transmit beamforming and receive combining is a low complexity approach for communications in the multiuser multiple-input multiple-output (MIMO) channel. This pa...
PC
2002
13 years 7 months ago
2002
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
BMCBI
2010
13 years 4 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
IJCAI
2007
13 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...