Sciweavers

    2 search results - page 1 / 1
    » How frequently is a system of 2-linear Boolean equations sol...
    Sort
    View
    CORR
    2010
    Springer
    102views Education» more  CORR 2010»
    How frequently is a system of 2-linear Boolean equations solvable?
    15 years 5 months ago
    How frequently is a system of 2-linear Boolean equations solvable?
    Download  www.combinatorics.org
    Boris Pittel, Ji-A Yeum
    claim paper
    Read More »
    ICASSP
    2009
    IEEE
    146views Signal Processing» more  ICASSP 2009»
    Detection of sparse signals under finite-alphabet constraints
    15 years 9 months ago
    Detection of sparse signals under finite-alphabet constraints
    Download  ens.ewi.tudelft.nl
    In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
    Zhi Tian, Geert Leus, Vincenzo Lottici
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.