One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics (Q5423025): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q51088284, #quickstatements; #temporary_batch_1711439739529 |
ReferenceBot (talk | contribs) Changed an Item |
||
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
One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics (English)
0 references
30 October 2007
0 references