One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics

Lei Xu. One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics. Neural Computation, 19(2):546-569, 2007. [doi]

@article{Xu07:3,
  title = {One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics},
  author = {Lei Xu},
  year = {2007},
  doi = {10.1162/neco.2007.19.2.546},
  url = {http://dx.doi.org/10.1162/neco.2007.19.2.546},
  tags = {programming},
  researchr = {https://researchr.org/publication/Xu07%3A3},
  cites = {0},
  citedby = {0},
  journal = {Neural Computation},
  volume = {19},
  number = {2},
  pages = {546-569},
}