@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
}

{"_id":"dyeBWcE8RSgKM8kti","bibbaseid":"ogrady-pearlmutter-discoveringspeechphonesusingconvolutivenonnegativematrixfactorisationwithasparsenessconstraint-2008","author_short":["O'Grady, P. D.","Pearlmutter, B. A."],"bibdata":{"bibtype":"article","type":"article","added-at":"2009-01-13T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["O'Grady"],"firstnames":["Paul","D."],"suffixes":[]},{"propositions":[],"lastnames":["Pearlmutter"],"firstnames":["Barak","A."],"suffixes":[]}],"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","bibtex":"@article{journals/ijon/OGradyP08,\n added-at = {2009-01-13T00:00:00.000+0100},\n author = {O'Grady, Paul D. and Pearlmutter, Barak A.},\n biburl = {https://www.bibsonomy.org/bibtex/21926e0e6dad290bc7396c687eea8fa44/dblp},\n date = {2009-01-13},\n description = {dblp},\n ee = {http://dx.doi.org/10.1016/j.neucom.2008.01.033},\n interhash = {54c7b05edaa6031be5f6e92f4a818593},\n intrahash = {1926e0e6dad290bc7396c687eea8fa44},\n journal = {Neurocomputing},\n keywords = {dblp},\n number = {1-3},\n pages = {88-101},\n timestamp = {2009-01-15T11:33:48.000+0100},\n title = {Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint.},\n url = {http://dblp.uni-trier.de/db/journals/ijon/ijon72.html#OGradyP08},\n volume = 72,\n year = 2008\n}\n\n","author_short":["O'Grady, P. D.","Pearlmutter, B. A."],"key":"journals/ijon/OGradyP08","id":"journals/ijon/OGradyP08","bibbaseid":"ogrady-pearlmutter-discoveringspeechphonesusingconvolutivenonnegativematrixfactorisationwithasparsenessconstraint-2008","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.neucom.2008.01.033","Paper":"http://dblp.uni-trier.de/db/journals/ijon/ijon72.html#OGradyP08"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/barak ?items=1000","dataSources":["sNDcqxpX5cBQ5Pu7G"],"keywords":["dblp"],"search_terms":["discovering","speech","phones","using","convolutive","non","negative","matrix","factorisation","sparseness","constraint","o'grady","pearlmutter"],"title":"Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint.","year":2008}