Thomas R. Hancock

According to our database, Thomas R. Hancock authored at least 17 papers between 1990 and 1998.

Collaborative distances:

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

1998

A robust landmark-based system for vehicle location using low-bandwidth vision.

Long-Ji Lin, Thomas R. Hancock, J. Stephen Judd

Robotics Auton. Syst., 1998

1996

On learning ?-perceptron networks on the uniform distribution.

Mostefa Golea, Mario Marchand, Thomas R. Hancock

Neural Networks, 1996

Guest Editor's Introduction.

Thomas R. Hancock

Mach. Learn., 1996

Asking Questions to Minimize Errors.

Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar

J. Comput. Syst. Sci., 1996

Lower Bounds on Learning Decision Lists and Trees.

Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp

Inf. Comput., 1996

1995

Learning Arithmetic Read-Once Formulas.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein

SIAM J. Comput., 1995

Learning Boolean Read-Once Formulas over Generalized Bases.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein

J. Comput. Syst. Sci., 1995

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).

Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp

Proceedings of the STACS 95, 1995

1994

Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries.

Thomas R. Hancock, Mostefa Golea, Mario Marchand

Mach. Learn., 1994

An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski

Comput. Complex., 1994

1993

Learning <i>k</i>µ Decision Trees on the Uniform Distribution.

Thomas R. Hancock

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

1992

On Learning µ-Perceptron Networks with Binary Weights.

Mostefa Golea, Mario Marchand, Thomas R. Hancock

Proceedings of the Advances in Neural Information Processing Systems 5, [NIPS Conference, Denver, Colorado, USA, November 30, 1992

Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Learning Monotone <i>kµ</i> DNF Formulas on Product Distributions.

Thomas R. Hancock, Yishay Mansour

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

Learning Read-Once Formulas over Fields and Extended Bases.

Thomas R. Hancock, Lisa Hellerstein

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

Learning 2µ DNF Formulas and <i>kµ</i> Decision Trees.

Thomas R. Hancock

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

1990

Identifying µ-Formula Decision Trees with Queries.

Thomas R. Hancock

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