Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint. O'Grady, P. D. & Pearlmutter, B. A. Neurocomputing, 72(1-3):88-101, 2008.
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint. [link]Link  Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint. [link]Paper  bibtex   
@article{journals/ijon/OGradyP08,
  added-at = {2009-01-13T00:00:00.000+0100},
  author = {O'Grady, Paul D. and Pearlmutter, Barak A.},
  biburl = {https://www.bibsonomy.org/bibtex/21926e0e6dad290bc7396c687eea8fa44/dblp},
  date = {2009-01-13},
  description = {dblp},
  ee = {http://dx.doi.org/10.1016/j.neucom.2008.01.033},
  interhash = {54c7b05edaa6031be5f6e92f4a818593},
  intrahash = {1926e0e6dad290bc7396c687eea8fa44},
  journal = {Neurocomputing},
  keywords = {dblp},
  number = {1-3},
  pages = {88-101},
  timestamp = {2009-01-15T11:33:48.000+0100},
  title = {Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint.},
  url = {http://dblp.uni-trier.de/db/journals/ijon/ijon72.html#OGradyP08},
  volume = 72,
  year = 2008
}

Downloads: 0