Vijay Raghavan

According to our database, Vijay Raghavan authored at least 25 papers between 1990 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

Scalar aggregation in inconsistent databases.

Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy P. Spinrad

Theor. Comput. Sci., 2003

A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions.

Calvin R. Maurer Jr., Rensheng Qi, Vijay Raghavan

IEEE Trans. Pattern Anal. Mach. Intell., 2003

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number.

Stefan Felsner, Vijay Raghavan, Jeremy P. Spinrad

Order, 2003

2002

Exact learning of DNF formulas using DNF hypotheses.

Lisa Hellerstein, Vijay Raghavan

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001

Monotone term decision lists.

David Guijarro, Víctor Lavín, Vijay Raghavan

Theor. Comput. Sci., 2001

Robust algorithms for restricted domains.

Vijay Raghavan, Jeremy P. Spinrad

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions.

Calvin R. Maurer Jr., Vijay Raghavan, Rensheng Qi

Proceedings of the Information Processing in Medical Imaging, 2001

2000

Editor's Foreword.

Vijay Raghavan

J. Comput. Syst. Sci., 2000

Solving Problems on Special Classes of Graphs.

Vijay Raghavan, Jeremy P. Spinrad

Electron. Notes Discret. Math., 2000

Decision Tree Approximations of Boolean Functions.

Dinesh P. Mehta, Vijay Raghavan

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

Exact Learning when Irrelevant Variables Abound.

David Guijarro, Víctor Lavín, Vijay Raghavan

Proceedings of the Computational Learning Theory, 4th European Conference, 1999

1998

On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms.

Antoni Lozano, Vijay Raghavan

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

A Characterization and Nearly Linear-Time Equivalence Test for µ-Branching Programs.

Vijay Raghavan, Dawn Wilkins

Theory Comput. Syst., 1997

Learning Monotone Term Decision Lists.

David Guijarro, Víctor Lavín, Vijay Raghavan

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

Weighted Diagnosis with Asymmetric Invalidation.

Vijay Raghavan

IEEE Trans. Computers, 1996

1995

How many queries are needed to learn?

Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan, Dawn Wilkins

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

On the Limits of Proper Learnability of Subclasses of DNF Formulas.

Krishnan Pillaipakkamnatt, Vijay Raghavan

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

On Asymmetric Invalidation with Partial Tests.

Vijay Raghavan

IEEE Trans. Computers, 1993

A Linear Time Equivalene Test for Read-Twice DNF Formulas.

Krishnan Pillaipakkamnatt, Vijay Raghavan

Inf. Process. Lett., 1993

Read-twice DNF formulas are properly learnable.

Krishnan Pillaipakkamnatt, Vijay Raghavan

Proceedings of the First European Conference on Computational Learning Theory, 1993

Learning µ-branching Programs with Queries.

Vijay Raghavan, Dawn Wilkins

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1991

Sequential Diagnosability is Co-NP Complete.

Vijay Raghavan, Anand R. Tripathi

IEEE Trans. Computers, 1991

Improved Diagnosability Algorithms.

Vijay Raghavan, Anand R. Tripathi

IEEE Trans. Computers, 1991

Bounded Degree Graph Inference from Walks.

Vijay Raghavan

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990

Learning Switch Configurations.

Vijay Raghavan, Stephen R. Schach

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990