The SCEAS System
| |||||||

## Search the dblp DataBase
Santosh S. Venkatesh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Shao C. Fang, Santosh S. Venkatesh
**On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions.**[Citation Graph (0, 0)][DBLP] COLT, 1993, pp:310-316 [Conf] - Joel Ratsaby, Santosh S. Venkatesh
**Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information.**[Citation Graph (0, 0)][DBLP] COLT, 1995, pp:412-417 [Conf] - Santosh S. Venkatesh
**On Learning Binary Weights for Majority Functions.**[Citation Graph (0, 0)][DBLP] COLT, 1991, pp:257-266 [Conf] - Santosh S. Venkatesh, Robert R. Snapp, Demetri Psaltis
**Bellman Strikes Again! The Growth Rate of Sample Complexity with Dimension for the Nearest Neighbor Classifier.**[Citation Graph (0, 0)][DBLP] COLT, 1992, pp:93-102 [Conf] - Changfeng Wang, Santosh S. Venkatesh
**Criteria for Specifying Machine Complexity in Learning.**[Citation Graph (0, 0)][DBLP] COLT, 1995, pp:273-280 [Conf] - Carl A. Gunter, Sanjeev Khanna, Kaijun Tan, Santosh S. Venkatesh
**DoS Protection for Reliably Authenticated Broadcast.**[Citation Graph (0, 0)][DBLP] NDSS, 2004, pp:- [Conf] - Pierre Baldi, Santosh S. Venkatesh
**On Properties of Networks of Neuron-Like Elements.**[Citation Graph (0, 0)][DBLP] NIPS, 1987, pp:41-51 [Conf] - Sanjay Biswas, Santosh S. Venkatesh
**The Devil and the Network.**[Citation Graph (0, 0)][DBLP] NIPS, 1990, pp:883-889 [Conf] - Robert R. Snapp, Demetri Psaltis, Santosh S. Venkatesh
**Asymptotic Slowing Down of the Nearest-Neighbor Classifier.**[Citation Graph (0, 0)][DBLP] NIPS, 1990, pp:932-938 [Conf] - Changfeng Wang, Santosh S. Venkatesh
**Temporal Dynamics of Generalization in Neural Networks.**[Citation Graph (0, 0)][DBLP] NIPS, 1994, pp:263-270 [Conf] - Changfeng Wang, Santosh S. Venkatesh, J. Stephen Judd
**Optimal Stopping and Effective Machine Complexity in Learning.**[Citation Graph (0, 0)][DBLP] NIPS, 1993, pp:303-310 [Conf] - Alon Orlitsky, Santosh S. Venkatesh
**On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:2, pp:151-178 [Journal] - Santosh S. Venkatesh, Pierre Baldi
**Programmed interactions in higher-order neural networks: Maximal capacity.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1991, v:7, n:3, pp:316-337 [Journal] - Santosh S. Venkatesh, Pierre Baldi
**Programmed interactions in higher-order neural networks: The outer-product algorithm.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1991, v:7, n:4, pp:443-479 [Journal] - Shao C. Fang, Santosh S. Venkatesh
**Learning Binary Perceptrons Perfectly Efficiently.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:52, n:2, pp:374-389 [Journal] - Santosh S. Venkatesh
**Directed Drift: A New Linear Threshold Algorithm for Learning Binary Weights On-Line.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1993, v:46, n:2, pp:198-217 [Journal] - Santosh S. Venkatesh, Girish Pancha, Demetri Psaltis, Gabriel Sirat
**Shaping attraction basins in neural networks.**[Citation Graph (0, 0)][DBLP] Neural Networks, 1990, v:3, n:6, pp:613-623 [Journal] - Santosh S. Venkatesh, Demetri Psaltis
**On Reliable Computation With Formal Neurons.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Pattern Anal. Mach. Intell., 1992, v:14, n:1, pp:87-91 [Journal] - Shao C. Fang, Santosh S. Venkatesh
**The capacity of majority rule.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1998, v:12, n:1, pp:83-109 [Journal] - Shao C. Fang, Santosh S. Venkatesh
**Learning finite binary sequences from half-space data.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1999, v:14, n:4, pp:345-381 [Journal] - Shao C. Fang, Santosh S. Venkatesh
**A Threshold Function for Harmonic Update.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1997, v:10, n:3, pp:482-498 [Journal] - Pierre Baldi, Santosh S. Venkatesh
**Random interactions in higher order neural networks.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:274-0 [Journal] - Inchi Hu, Santosh S. Venkatesh
**On the minimum expected duration of a coin tossing game.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:581-593 [Journal] - Sanjeev R. Kulkarni, Gábor Lugosi, Santosh S. Venkatesh
**Learning Pattern Classification - A Survey.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2178-2206 [Journal] - Robert J. McEliece, Edward C. Posner, Eugene R. Rodemich, Santosh S. Venkatesh
**The capacity of the Hopfield associative memory.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:461-482 [Journal] - Demetri Psaltis, Robert R. Snapp, Santosh S. Venkatesh
**On the finite sample performance of the nearest neighbor classifier.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:820-837 [Journal] - Santosh S. Venkatesh
**Robustness in neural computation: Random graphs and sparsity.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1114-0 [Journal] - Santosh S. Venkatesh, Joel Franklin
**How much information can one bit of memory retain about a Bernoulli sequence?**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1595-1604 [Journal] - Santosh S. Venkatesh, Demetri Psaltis
**Linear and logarithmic capacities in associative neural networks.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:3, pp:558-568 [Journal] - Santosh S. Venkatesh, Demetri Psaltis
**Correction to "Linear and Logarithmic Capacities in Associative Neural Networks".**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:854- [Journal] - Santosh S. Venkatesh
**The Science of Making ERORS: What Error Tolerance Implies for Capacity in Neural Networks.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Knowl. Data Eng., 1992, v:4, n:2, pp:135-144 [Journal] **Adaptive SelectiveVerification.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |