One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics (Q5423025): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1162/neco.2007.19.2.546 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087186354 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q51088284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent component analysis, a new concept? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive blind separation of independent sources: A deflation approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Algorithms with Orthogonality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Bit-Matching Conjecture for Independent Component Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: HIGH-ORDER CONTRASTS FOR SELF-ADAPTIVE SOURCE SEPARATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constrained EM Algorithm for Independent Component Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learned parametric mixture based ICA algorithm / rank
 
Normal rank

Latest revision as of 11:08, 27 June 2024

scientific article; zbMATH DE number 5206625
Language Label Description Also known as
English
One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics
scientific article; zbMATH DE number 5206625

    Statements

    Identifiers