C. E. Veni Madhavan

According to our database1, C. E. Veni Madhavan authored at least 59 papers between 1980 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Undetectable least significant bit replacement steganography.
Multim. Tools Appl., 2019

2017
Family of PRGs based on Collections of Arithmetic Progressions.
IACR Cryptol. ePrint Arch., 2017

Keynote address: Quo Vadis PKI?
Proceedings of the 2017 International Conference on Public Key Infrastructure and its Applications, 2017

2014
Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences.
J. Symb. Comput., 2014

Sarcasm Detection using Sentiment and Semantic Features.
Proceedings of the KDIR 2014 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Rome, Italy, 21, 2014

2013
Improved LSB stegananalysis based on analysis of adjacent pixel pairs.
Signal Image Video Process., 2013

Text Simplification for Enhanced Readability.
Proceedings of the KDIR/KMIS 2013 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval and the International Conference on Knowledge Management and Information Sharing, Vilamoura, Algarve, Portugal, 19, 2013

2012
Understanding Human Navigation Using Network Analysis.
Top. Cogn. Sci., 2012

Diversity in Ranking using Negative Reinforcement
CoRR, 2012

A Navigation Algorithm Inspired by Human Navigation.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
A Navigation Algorithm Inspired by Human Navigation
CoRR, 2011

A non-syntactic approach for text sentiment classification with stopwords.
Proceedings of the 20th International Conference on World Wide Web, 2011

A Stylometric Study and Assessment of Machine Translators.
Proceedings of the Advances in Intelligent Data Analysis X - 10th International Symposium, 2011

Improving Query Focused Summarization Using Look-Ahead Strategy.
Proceedings of the Advances in Information Retrieval, 2011

A Network Analysis Approach to Understand Human-wayfinding Problem.
Proceedings of the 33th Annual Meeting of the Cognitive Science Society, 2011

2010
On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2010

Cover Image Preprocessing for More Reliable LSB Replacement Steganography.
Proceedings of the 2010 International Conference on Signal Acquisition and Processing, 2010

Image Classification for More Reliable Steganalysis.
Proceedings of the Recent Trends in Network Security and Applications, 2010

2009
Measures for classification and detection in steganalysis
CoRR, 2009

Stopword Graphs and Authorship Attribution in Text Corpora.
Proceedings of the 3rd IEEE International Conference on Semantic Computing (ICSC 2009), 2009

Clustering in Concept Association Networks.
Proceedings of the Pattern Recognition and Machine Intelligence, 2009

A perturbative resampling approach to image steganalysis.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2009

2008
Two New Families of Low-Correlation Interleaved QAM Sequences.
Proceedings of the Sequences and Their Applications, 2008

Low correlation interleaved QAM sequences.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Bit Domain Encryption.
Proceedings of the Advanced Concepts for Intelligent Vision Systems, 2008

2007
Bit Plane Encoding and Encryption.
Proceedings of the Pattern Recognition and Machine Intelligence, 2007

Discovering Mentorship Information from Author Collaboration Networks.
Proceedings of the Discovery Science, 10th International Conference, 2007

2006
Resampling Operations as Features for Detecting LSB Replacement and LSB Matching in Color Images.
Proceedings of the Multimedia Content Representation, 2006

2005
On the cubic sieve method for computing discrete logarithms over prime fields.
Int. J. Comput. Math., 2005

2003
Cryptological Applications of Permutation Polynomials.
Electron. Notes Discret. Math., 2003

2002
General Partitioning on Random Graphs.
J. Algorithms, 2002

Clique tree generalization and new subclasses of chordal graphs.
Discret. Appl. Math., 2002

2001
Lower Bounds for OBDDs and Nisan's pseudorandom generator.
Electron. Colloquium Comput. Complex., 2001

On Assigning Prefix Free Codes to the Vertices of a Graph.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
An Online, Transferable E-Cash Payment System.
Proceedings of the Progress in Cryptology, 2000

1999
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998
Algorithms for coloring semi-random graphs.
Random Struct. Algorithms, 1998

Minimal Vertex Separators of Chordal Graphs.
Discret. Appl. Math., 1998

1995
Stack and Queue Number of 2-Trees.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
An algorithm for recognizing palm polygons.
Vis. Comput., 1994

Coloring Semi-Random Graphs in Polynomial Expected Time.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993
Characterizing and Recognizing Weak Visibility Polygons.
Comput. Geom., 1993

Coloring Random Graphs in Polynomial Expected Time.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Shortest Watchman Tours in Weak Visibility Polygons.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs.
Inf. Process. Lett., 1992

1991
Computing the Shortest Path Tree in a Weak Visibility Polygon.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990
Circuits, Pebbling and Expressibility.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989
An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem.
Inf. Process. Lett., 1989

A New Class of Separators and Planarity of Chordal Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1987
An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases.
Theor. Comput. Sci., 1987

Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
Binary Decompositions and Acyclic Schemes.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

1985
A comparative study of multiple attribute tree and inverted file structures for large bibliographic files.
Inf. Process. Manag., 1985

The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

1984
Secondary Attribute Retrieval Using Tree Data Structures.
Theor. Comput. Sci., 1984

Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

Recognition and Top-Down Generation of beta-Acyclic Database Schemes.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1983
Comments on "Optimal Design of Distributed Information Systems".
IEEE Trans. Computers, 1983

1980
Performance Evaluation of Attribute-Based Tree Organization.
ACM Trans. Database Syst., 1980


  Loading...