Sciweavers

1897 search results - page 38 / 380
» Sparse Additive Machine
Sort
View
108
Voted
INTERSPEECH
2010
14 years 7 months ago
Artificial and online acquired noise dictionaries for noise robust ASR
Recent research has shown that speech can be sparsely represented using a dictionary of speech segments spanning multiple frames, exemplars, and that such a sparse representation ...
Jort F. Gemmeke, Tuomas Virtanen
CIDR
2007
156views Algorithms» more  CIDR 2007»
15 years 2 months ago
Column Stores for Wide and Sparse Data
While it is generally accepted that data warehouses and OLAP workloads are excellent applications for column-stores, this paper speculates that column-stores may well be suited fo...
Daniel J. Abadi
86
Voted
ICALP
2010
Springer
15 years 2 months ago
Sparse Reliable Graph Backbones
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David...
ICASSP
2009
IEEE
15 years 7 months ago
Complex NMF: A new sparse representation for acoustic signals
This paper presents a new sparse representation for acoustic signals which is based on a mixing model defined in the complex-spectrum domain (where additivity holds), and allows ...
Hirokazu Kameoka, Nobutaka Ono, Kunio Kashino, Shi...
101
Voted
CORR
2004
Springer
152views Education» more  CORR 2004»
15 years 11 days ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer