![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 8 | Oren Shriki, Haim Sompolinsky, Daniel D. Lee: An Information Maximization Approach to Overcomplete and Recurrent Representations. NIPS 2000: 612-618 | |
| 5 | Daniel D. Lee, Uri Rokni, Haim Sompolinsky: Algorithms for Independent Components Analysis and Higher Order Statistics. NIPS 1999: 491-497 | |
| 4 | Daniel D. Lee, Haim Sompolinsky: Learning a Continuous Hidden Variable Model for Binary Data. NIPS 1998: 515-521 |
Selection of 3 from 47 records - Daniel D. Lee has 48 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page