Sciweavers

    768 search results - page 4 / 154
    » Asymptotic Cellular Complexity
    Sort
    View
    LICS
    2008
    IEEE
    116views Automated Reasoning» more  LICS 2008»
    On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
    14 years 1 months ago
    On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
    Download  www.eecs.qmul.ac.uk
    We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
    Søren Riis
    claim paper
    Read More »
    TSP
    2008
    117views more  TSP 2008»
    Asymptotically Efficient Reduced Complexity Frequency Offset and Channel Estimators for Uplink MIMO-OFDMA Systems
    13 years 7 months ago
    Asymptotically Efficient Reduced Complexity Frequency Offset and Channel Estimators for Uplink MIMO-OFDMA Systems
    Download  www.supelec.fr
    In this paper, we address the joint data-aided estimation of frequency offsets and channel coefficients in uplink MIMO-OFDMA systems. As the Maximum Likelihood (ML) estimator is i...
    Serdar Sezginer, Pascal Bianchi
    claim paper
    Read More »
    ICC
    2007
    IEEE
    139views Communications» more  ICC 2007»
    Asymptotically Efficient Reduced-Complexity Frequency Offset Estimation for Uplink MIMO-OFDMA Systems
    14 years 1 months ago
    Asymptotically Efficient Reduced-Complexity Frequency Offset Estimation for Uplink MIMO-OFDMA Systems
    Download  www.prism.uvsq.fr
    Serdar Sezginer, Pascal Bianchi
    claim paper
    Read More »
    JSAC
    2007
    86views more  JSAC 2007»
    Asymptotically optimal cooperative wireless networks with reduced signaling complexity
    13 years 7 months ago
    Asymptotically optimal cooperative wireless networks with reduced signaling complexity
    Download  www.eurecom.fr
    Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
    Petros Elia, Frédérique E. Oggier, P...
    claim paper
    Read More »
    COMBINATORICS
    1998
    62views more  COMBINATORICS 1998»
    A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
    13 years 7 months ago
    A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
    Download  www.ccs.neu.edu
    Alexander Russell, Ravi Sundaram
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.