Santosh S. Venkatesh

According to our database1, Santosh S. Venkatesh authored at least 50 papers between 1987 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Visibility-Aware Optimal Contagion of Malware Epidemics.
IEEE Trans. Automat. Contr., 2017

Spread, then Target, and Advertise in Waves: Optimal Capital Allocation Across Advertising Channels.
CoRR, 2017

Spread, then target, and advertise in waves: Optimal capital allocation across advertising channels.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

2016
Optimal Patching in Clustered Malware Epidemics.
IEEE/ACM Trans. Netw., 2016

2015
Optimal Energy-Aware Epidemic Routing in DTNs.
IEEE Trans. Automat. Contr., 2015

Visibility-Aware Optimal Contagion of Malware Epidemics.
CoRR, 2015

Taming epidemic outbreaks in mobile adhoc networks.
Ad Hoc Networks, 2015

2014
Optimal Patching in Clustered Malware Epidemics.
CoRR, 2014

Optimal Energy-Aware Epidemic Routing in DTNs.
CoRR, 2014

2012
Adaptive Selective Verification: An Efficient Adaptive Countermeasure to Thwart DoS Attacks.
IEEE/ACM Trans. Netw., 2012

Optimal energy-aware epidemic routing in DTNs.
Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2012

Closing the Pandora's box: Defenses for thwarting epidemic outbreaks in mobile adhoc networks.
Proceedings of the 9th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2012

2011
Market-based control of epidemics.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2008
Adaptive SelectiveVerification.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
Correction to "Linear and Logarithmic Capacities in Associative Neural Networks".
IEEE Trans. Information Theory, 2007

2004
DoS Protection for Reliably Authenticated Broadcast.
Proceedings of the Network and Distributed System Security Symposium, 2004

2000
A systematic approach to detecting OFDM signals in a fading channel.
IEEE Trans. Communications, 2000

1999
Learning finite binary sequences from half-space data.
Random Struct. Algorithms, 1999

1998
Learning Pattern Classification - A Survey.
IEEE Trans. Information Theory, 1998

The capacity of majority rule.
Random Struct. Algorithms, 1998

Pilot symbol assisted diversity reception for a fading channel.
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998

1997
A Threshold Function for Harmonic Update.
SIAM J. Discrete Math., 1997

1996
Learning Binary Perceptrons Perfectly Efficiently.
J. Comput. Syst. Sci., 1996

On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures.
Discrete Applied Mathematics, 1996

1995
Criteria for Specifying Machine Complexity in Learning.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994
On the finite sample performance of the nearest neighbor classifier.
IEEE Trans. Information Theory, 1994

Temporal Dynamics of Generalization in Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 7, 1994

Asymptotic predictions of the finite-sample risk of the k-nearest-neighbor classifier.
Proceedings of the 12th IAPR International Conference on Pattern Recognition, 1994

1993
On the minimum expected duration of a coin tossing game.
IEEE Trans. Information Theory, 1993

Random interactions in higher order neural networks.
IEEE Trans. Information Theory, 1993

Directed Drift: A New Linear Threshold Algorithm for Learning Binary Weights On-Line.
J. Comput. Syst. Sci., 1993

Optimal Stopping and Effective Machine Complexity in Learning.
Proceedings of the Advances in Neural Information Processing Systems 6, 1993

On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
The Science of Making ERORS: What Error Tolerance Implies for Capacity in Neural Networks.
IEEE Trans. Knowl. Data Eng., 1992

Robustness in neural computation: Random graphs and sparsity.
IEEE Trans. Information Theory, 1992

On Reliable Computation With Formal Neurons.
IEEE Trans. Pattern Anal. Mach. Intell., 1992

Bellman Strikes Again! The Growth Rate of Sample Complexity with Dimension for the Nearest Neighbor Classifier.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
How much information can one bit of memory retain about a Bernoulli sequence?
IEEE Trans. Information Theory, 1991

Programmed interactions in higher-order neural networks: The outer-product algorithm.
J. Complexity, 1991

Programmed interactions in higher-order neural networks: Maximal capacity.
J. Complexity, 1991

On Learning Binary Weights for Majority Functions.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990
Shaping attraction basins in neural networks.
Neural Networks, 1990

Asymptotic Slowing Down of the Nearest-Neighbor Classifier.
Proceedings of the Advances in Neural Information Processing Systems 3, 1990

The Devil and the Network.
Proceedings of the Advances in Neural Information Processing Systems 3, 1990

1989
Binary filters for pattern classification.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1989

Linear and logarithmic capacities in associative neural networks.
IEEE Trans. Information Theory, 1989

1988
Composite algorithms for shaping attraction basins.
Neural Networks, 1988

1987
The capacity of the Hopfield associative memory.
IEEE Trans. Information Theory, 1987

On Properties of Networks of Neuron-Like Elements.
Proceedings of the Neural Information Processing Systems, Denver, Colorado, USA, 1987, 1987


  Loading...