CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Venkatesh-S-S"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 1993 | 1992 | 1991 | 1989 | 1987
Number of items: 5.

1993

Psaltis, Demetri and Snapp, Robert R. and Venkatesh, Santosh S. (1993) On the Finite Sample Performance of the Nearest Neighbor Classifier. In: Proceedings. IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 354. ISBN 0-7803-0878-6. https://resolver.caltech.edu/CaltechAUTHORS:20170530-155148945

1992

Venkatesh, Santosh S. and Snapp, Robert R. and Psaltis, Demetri (1992) Bellman strikes again!: the growth rate of sample complexity with dimension for the nearest neighbor classifier. In: COLT '92 Proceedings of the fifth annual workshop on Computational learning theory. ACM , New York, NY, pp. 93-102. ISBN 0-89791-497-X. https://resolver.caltech.edu/CaltechAUTHORS:20170103-173502617

1991

Venkatesh, Santosh S. and Franklin, Joel (1991) How much information can one bit of memory retain about a Bernoulli sequence? IEEE Transactions on Information Theory, 37 (6). pp. 1595-1604. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20190304-142847195

1989

Venkatesh, Santosh S. and Psaltis, Demetri (1989) Linear and logarithmic capacities in associative neural networks. IEEE Transactions on Information Theory, 35 (3). pp. 558-568. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:VENieeetit89

1987

McEliece, Robert J. and Posner, Edward C. and Rodemich, Eugene R. et al. (1987) The capacity of the Hopfield associative memory. IEEE Transactions on Information Theory, 33 (4). pp. 461-482. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit87

This list was generated on Sun Oct 20 05:55:16 2019 PDT.