Thomas R. Hancock

发表

An algorithm to learn read-once threshold formulas, and transformations between learning models

Marek Karpinski, Lisa Hellerstein, Nader H. Bshouty, 2005, computational complexity.

Identifying μ-formula decision trees with queries

Thomas R. Hancock, T. Hancock, 1990, COLT '90.

Asking questions to minimize errors

Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, 1993, COLT '93.

AUTOMATIC VEHICLE LOCATION USING CAMERAS: A DEMONSTRATION

Scott Rickard, Thomas R. Hancock, J. S. Judd, 1997 .

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

J. Stephen Judd, Thomas R. Hancock, Long-Ji Lin, 1998, Robotics Auton. Syst..

On Learning µ-Perceptron Networks with Binary Weights

Mario Marchand, Thomas R. Hancock, Mostefa Golea, 1992, NIPS.

On learning ?-perceptron networks on the uniform distribution

Mario Marchand, Thomas R. Hancock, Mostefa Golea, 1996, Neural Networks.

Guest Editor's Introduction

Thomas R. Hancock, 2005, Machine Learning.

0688 Application for Pension [and Related Records]

Thomas R. Hancock, .

Learning Boolean Read-Once Formulas over Generalized Bases

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1995, J. Comput. Syst. Sci..

Automatic vehicle location using sensory maps: a brief demonstration

Scott Rickard, Thomas R. Hancock, J. S. Judd, 1997, Proceedings of Conference on Intelligent Transportation Systems.

Asking Questions to Minimize Errors

Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, 1996, J. Comput. Syst. Sci..

Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries

Mario Marchand, Thomas R. Hancock, Mostefa Golea, 1994, Machine Learning.

Learning Arithmetic Read-Once Formulas

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1995, SIAM J. Comput..

Learning 2µ DNF Formulas and kµ Decision Trees

Thomas R. Hancock, T. Hancock, 1991, COLT.

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

Tao Jiang, Ming Li, John Tromp, 1995, STACS.

Learning arithmetic read-once formulas

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1992, STOC '92.

Learning 2u DNF formulas and ku decision trees

Thomas R. Hancock, T. Hancock, 1991, COLT 1991.

Learning kμ decision trees on the uniform distribution

Thomas R. Hancock, 1993, COLT '93.

Learning monotone ku DNF formulas on product distributions

Yishay Mansour, Thomas R. Hancock, Y. Mansour, 1991, COLT '91.

Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1992, COLT '92.

Learning nonoverlapping perceptron networks from examples and membership queries

Mario Marchand, Thomas R. Hancock, Mostefa Golea, 2004, Machine Learning.

Learning read-once formulas over fields and extended bases

Lisa Hellerstein, Thomas R. Hancock, L. Hellerstein, 1991, COLT '91.

Read-Once Threshold Formulas, Justifying Assignments, and Generic Transformations

Marek Karpinski, Lisa Hellerstein, Nader H. Bshouty, 1991 .

An Algorithm to Learn Read-Once Threshold Formulas, and some Generic Transformations between Learning Models

Marek Karpinski, Lisa Hellerstein, Nader H. Bshouty, 1993 .