Sciweavers

    1331 search results - page 7 / 267
    » Complexity bounds for zero-test algorithms
    Sort
    View
    GLOBECOM
    2010
    IEEE
    120views Communications» more  GLOBECOM 2010»
    Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
    13 years 5 months ago
    Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
    Download  ece.iisc.ernet.in
    In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
    N. Srinidhi, Tanumay Datta, Ananthanarayanan Chock...
    claim paper
    Read More »
    IANDC
    2010
    79views more  IANDC 2010»
    Complexity of deciding bisimilarity between normed BPA and normed BPP
    13 years 6 months ago
    Complexity of deciding bisimilarity between normed BPA and normed BPP
    Download  www.cs.vsb.cz
    We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
    Petr Jancar, Martin Kot, Zdenek Sawa
    claim paper
    Read More »
    STOC
    2012
    ACM
    221views Algorithms» more  STOC 2012»
    From query complexity to computational complexity
    11 years 10 months ago
    From query complexity to computational complexity
    Download  theory.stanford.edu
    We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
    Shahar Dobzinski, Jan Vondrák
    claim paper
    Read More »
    TIT
    1998
    90views more  TIT 1998»
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    13 years 7 months ago
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    Download  www.cst.uwaterloo.ca
    —Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
    Amir H. Banihashemi, Amir K. Khandani
    claim paper
    Read More »
    ISAAC
    2003
    Springer
    103views Algorithms» more  ISAAC 2003»
    Upper Bounds on the Complexity of Some Galois Theory Problems
    14 years 24 days ago
    Upper Bounds on the Complexity of Some Galois Theory Problems
    Download  www.cse.iitk.ac.in
    Vikraman Arvind, Piyush P. Kurur
    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.