T. Grossman

Learning by Choice of Internal Representations

Eytan Domany, Ron Meir, Tal Grossman, 1988, Complex Syst..

Off-training-set error for the Gibbs and the Bayes optimal generalizers

D. Wolpert, T. Grossman, E. Knill, 1995, COLT 1995.

Computational Experience with Approximation Algorithms for the Set Covering Problem

T. Grossman, A. Wool, Avishai WoolyDecember, 1994 .

Applying The INN Model to the MaxClique Problem

T. Grossman, 1993 .

Maximal A{posteriori Multi{sensor Multi{target Neural Data Fusion

T. Grossman, Eytan DomanyDepartment, 1999 .

Neural Net Representations of Empirical Protein Potentials

Tal Grossman, Robert M. Farber, Alan S. Lapedes, 1995, ISMB.

Structure and perimeters of percolation clusters

T. Grossman, A. Aharony, 1986 .

A neural computation approach to the set covering problem

T. Grossman, T. Grossman, 1995, NIPS 1995.

The CHIR Algorithm for Feed Forward Networks with Binary Weights

Tal Grossman, T. Grossman, 1989, NIPS.

Accessible external perimeters of percolation clusters

Amnon Aharony, T. Grossman, A. Aharony, 1987 .

Noise sensitivity signatures for model selection

Tal Grossman, Alan S. Lapedes, A. Lapedes, 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

Applying the INN model to the Maximum Clique problem

Tal Grossman, T. Grossman, 1993, Cliques, Coloring, and Satisfiability.