Shao C. Fang

According to our database, Shao C. Fang authored at least 5 papers between 1993 and 1999.

Collaborative distances:

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

1999

Learning finite binary sequences from half-space data.

Shao C. Fang, Santosh S. Venkatesh

Random Struct. Algorithms, 1999

1998

The capacity of majority rule.

Shao C. Fang, Santosh S. Venkatesh

Random Struct. Algorithms, 1998

1997

A Threshold Function for Harmonic Update.

Shao C. Fang, Santosh S. Venkatesh

SIAM J. Discret. Math., 1997

1996

Learning Binary Perceptrons Perfectly Efficiently.

Shao C. Fang, Santosh S. Venkatesh

J. Comput. Syst. Sci., 1996

1993

On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions.

Shao C. Fang, Santosh S. Venkatesh

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