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