Sciweavers

10608 search results - page 51 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
GLOBECOM
2006
IEEE
14 years 4 months ago
Low-Complexity Adaptive High-Resolution Channel Prediction for OFDM Systems
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
Ian C. Wong, Brian L. Evans
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
LATIN
2010
Springer
14 years 4 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 4 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
WDAG
2007
Springer
97views Algorithms» more  WDAG 2007»
14 years 4 months ago
On the Message Complexity of Indulgent Consensus
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...