Sciweavers

8824 search results - page 210 / 1765
» On the Complexity of Real Functions
Sort
View
GLOBECOM
2007
IEEE
16 years 26 days ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
16 years 27 days ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
SIAMREV
2010
110views more  SIAMREV 2010»
15 years 1 months ago
Complex Singularities and the Lorenz Attractor
The Lorenz attractor is one of the best known examples of applied mathematics. However, much of what is known about it is a result of numerical calculations and not of mathematica...
Divakar Viswanath, Sönmez Sahutoglu
GMP
2010
IEEE
354views Solid Modeling» more  GMP 2010»
15 years 6 months ago
Automatic Generation of Riemann Surface Meshes
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
Matthias Nieser, Konstantin Poelke, Konrad Polthie...
TVCG
2008
174views more  TVCG 2008»
15 years 6 months ago
Data-Driven Visualization and Group Analysis of Multichannel EEG Coherence with Functional Units
Abstract-- A typical data-driven visualization of electroencephalography (EEG) coherence is a graph layout, with vertices representing electrodes and edges representing significant...
Michael ten Caat, Natasha M. Maurits, Jos B. T. M....