"One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral ..."

Lei Xu (2007)

> Home

Details and statistics

DOI: 10.1162/NECO.2007.19.2.546

access: closed

type: Journal Article

metadata version: 2020-09-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/neco/Xu07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/neco/Xu07
Lei Xu:
One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics. Neural Comput. 19(2): 546-569 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.