- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j22 |      | Sanjeev Khanna, Santosh S. Venkatesh, Omid Fatemieh, Fariba Khan, Carl A. Gunter: Adaptive Selective Verification: An Efficient Adaptive Countermeasure to Thwart DoS Attacks. IEEE/ACM Trans. Netw. 20(3): 715-728 (2012) |
| c14 | | Rahul Potharaju, Md. Endadul Hoque, Cristina Nita-Rotaru, Saswati Sarkar, Santosh S. Venkatesh: Closing the Pandora's box: Defenses for thwarting epidemic outbreaks in mobile adhoc networks. MASS 2012: 200-208 |
| c13 | | M. H. R. Khouzani, Soheil Eshghi, Saswati Sarkar, Ness B. Shroff, Santosh S. Venkatesh: Optimal energy-aware epidemic routing in DTNs. MobiHoc 2012: 175-182 |
| 2008 | ||
| c12 | | Sanjeev Khanna, Santosh S. Venkatesh, Omid Fatemieh, Fariba Khan, Carl A. Gunter: Adaptive SelectiveVerification. INFOCOM 2008: 529-537 |
| 2007 | ||
| j21 | | 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 | ||
| c11 | | Carl A. Gunter, Sanjeev Khanna, Kaijun Tan, Santosh S. Venkatesh: DoS Protection for Reliably Authenticated Broadcast. NDSS 2004 |
| 2000 | ||
| j20 | | Selaka B. Bulumulla, Saleem A. Kassam, Santosh S. Venkatesh: A systematic approach to detecting OFDM signals in a fading channel. IEEE Transactions on Communications 48(5): 725-728 (2000) |
| 1999 | ||
| j19 | | Shao C. Fang, Santosh S. Venkatesh: Learning finite binary sequences from half-space data. Random Struct. Algorithms 14(4): 345-381 (1999) |
| 1998 | ||
| j18 | | Shao C. Fang, Santosh S. Venkatesh: The capacity of majority rule. Random Struct. Algorithms 12(1): 83-109 (1998) |
| j17 | | Sanjeev R. Kulkarni, Gábor Lugosi, Santosh S. Venkatesh: Learning Pattern Classification - A Survey. IEEE Transactions on Information Theory 44(6): 2178-2206 (1998) |
| 1997 | ||
| j16 | | Shao C. Fang, Santosh S. Venkatesh: A Threshold Function for Harmonic Update. SIAM J. Discrete Math. 10(3): 482-498 (1997) |
| 1996 | ||
| j15 | | 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) |
| j14 | | Shao C. Fang, Santosh S. Venkatesh: Learning Binary Perceptrons Perfectly Efficiently. J. Comput. Syst. Sci. 52(2): 374-389 (1996) |
| 1995 | ||
| c10 | | Changfeng Wang, Santosh S. Venkatesh: Criteria for Specifying Machine Complexity in Learning. COLT 1995: 273-280 |
| c9 | | Joel Ratsaby, Santosh S. Venkatesh: Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information. COLT 1995: 412-417 |
| 1994 | ||
| j13 | | 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) |
| c8 | | Changfeng Wang, Santosh S. Venkatesh: Temporal Dynamics of Generalization in Neural Networks. NIPS 1994: 263-270 |
| 1993 | ||
| j12 | | 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) |
| j11 | | Pierre Baldi, Santosh S. Venkatesh: Random interactions in higher order neural networks. IEEE Transactions on Information Theory 39(1): 274-283 (1993) |
| j10 | | 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) |
| c7 | | 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 |
| c6 | | Changfeng Wang, Santosh S. Venkatesh, J. Stephen Judd: Optimal Stopping and Effective Machine Complexity in Learning. NIPS 1993: 303-310 |
| 1992 | ||
| j9 | | Santosh S. Venkatesh, Demetri Psaltis: On Reliable Computation With Formal Neurons. IEEE Trans. Pattern Anal. Mach. Intell. 14(1): 87-91 (1992) |
| j8 | | Santosh S. Venkatesh: Robustness in neural computation: Random graphs and sparsity. IEEE Transactions on Information Theory 38(3): 1114-1119 (1992) |
| j7 | | 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) |
| c5 | | 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 |
| 1991 | ||
| j6 | | Santosh S. Venkatesh, Pierre Baldi: Programmed interactions in higher-order neural networks: Maximal capacity. J. Complexity 7(3): 316-337 (1991) |
| j5 | | Santosh S. Venkatesh, Pierre Baldi: Programmed interactions in higher-order neural networks: The outer-product algorithm. J. Complexity 7(4): 443-479 (1991) |
| j4 | | 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) |
| c4 | | |
| 1990 | ||
| j3 | | Santosh S. Venkatesh, Girish Pancha, Demetri Psaltis, Gabriel Sirat: Shaping attraction basins in neural networks. Neural Networks 3(6): 613-623 (1990) |
| c3 | | |
| c2 | | Robert R. Snapp, Demetri Psaltis, Santosh S. Venkatesh: Asymptotic Slowing Down of the Nearest-Neighbor Classifier. NIPS 1990: 932-938 |
| 1989 | ||
| j2 | | Santosh S. Venkatesh, Demetri Psaltis: Linear and logarithmic capacities in associative neural networks. IEEE Transactions on Information Theory 35(3): 558-568 (1989) |
| 1987 | ||
| j1 | | 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) |
| c1 | | Pierre Baldi, Santosh S. Venkatesh: On Properties of Networks of Neuron-Like Elements. NIPS 1987: 41-51 |
Colors in the list of coauthors
Last update Tue May 21 23:48:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page