Sciweavers

    143
    Voted
    IJON
    2008
    116views more  IJON 2008»
    Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
    15 years 3 months ago
    Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
    Download  www.bcl.hamilton.ie
    Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
    Paul D. O'Grady, Barak A. Pearlmutter
    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.