Principles and Typical Computational Limitations of Sparse Speaker Separation Based on Deterministic Speech Features (Q3116931): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q51558367, #quickstatements; #temporary_batch_1707303357582
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by superpositions of a sigmoidal function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast matching pursuit with a multiscale dictionary of Gaussian chirps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilayer feedforward networks are universal approximators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank

Latest revision as of 21:46, 4 July 2024

scientific article
Language Label Description Also known as
English
Principles and Typical Computational Limitations of Sparse Speaker Separation Based on Deterministic Speech Features
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references