The SCEAS System
| |||||||

## Search the dblp DataBase
Thomas R. Hancock:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
**Asking Questions to Minimize Errors.**[Citation Graph (0, 0)][DBLP] COLT, 1993, pp:41-50 [Conf] - Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
**Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates.**[Citation Graph (0, 0)][DBLP] COLT, 1992, pp:1-15 [Conf] - Thomas R. Hancock
**Identifying µ-Formula Decision Trees with Queries.**[Citation Graph (0, 0)][DBLP] COLT, 1990, pp:23-37 [Conf] - Thomas R. Hancock
**Learning 2µ DNF Formulas and**[Citation Graph (0, 0)][DBLP]*kµ*Decision Trees. COLT, 1991, pp:199-209 [Conf] - Thomas R. Hancock
**Learning**[Citation Graph (0, 0)][DBLP]*k*µ Decision Trees on the Uniform Distribution. COLT, 1993, pp:352-360 [Conf] - Thomas R. Hancock, Lisa Hellerstein
**Learning Read-Once Formulas over Fields and Extended Bases.**[Citation Graph (0, 0)][DBLP] COLT, 1991, pp:326-336 [Conf] - Thomas R. Hancock, Yishay Mansour
**Learning Monotone**[Citation Graph (0, 0)][DBLP]*kµ*DNF Formulas on Product Distributions. COLT, 1991, pp:179-183 [Conf] - Mostefa Golea, Mario Marchand, Thomas R. Hancock
**On Learning µ-Perceptron Networks with Binary Weights.**[Citation Graph (0, 0)][DBLP] NIPS, 1992, pp:591-598 [Conf] - Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp
**Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STACS, 1995, pp:527-538 [Conf] - Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
**Learning Arithmetic Read-Once Formulas**[Citation Graph (0, 0)][DBLP] STOC, 1992, pp:370-381 [Conf] - Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski
**An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1994, v:4, n:, pp:37-61 [Journal] - Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp
**Lower Bounds on Learning Decision Lists and Trees.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:126, n:2, pp:114-122 [Journal] - Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
**Asking Questions to Minimize Errors.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:52, n:2, pp:268-286 [Journal] - Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
**Learning Boolean Read-Once Formulas over Generalized Bases.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:50, n:3, pp:521-542 [Journal] - Thomas R. Hancock
**Guest Editor's Introduction.**[Citation Graph (0, 0)][DBLP] Machine Learning, 1996, v:25, n:2-3, pp:115-116 [Journal] - Thomas R. Hancock, Mostefa Golea, Mario Marchand
**Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries.**[Citation Graph (0, 0)][DBLP] Machine Learning, 1994, v:16, n:3, pp:161-183 [Journal] - Mostefa Golea, Mario Marchand, Thomas R. Hancock
**On learning ?-perceptron networks on the uniform distribution.**[Citation Graph (0, 0)][DBLP] Neural Networks, 1996, v:9, n:1, pp:67-82 [Journal] - Long-Ji Lin, Thomas R. Hancock, J. Stephen Judd
**A robust landmark-based system for vehicle location using low-bandwidth vision.**[Citation Graph (0, 0)][DBLP] Robotics and Autonomous Systems, 1998, v:25, n:1-2, pp:19-32 [Journal] - Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
**Learning Arithmetic Read-Once Formulas.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:4, pp:706-735 [Journal]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |