Shao C. Fang

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

1998
The capacity of majority rule.
Random Struct. Algorithms, 1998

1997
A Threshold Function for Harmonic Update.
SIAM J. Discret. Math., 1997

1996
Learning Binary Perceptrons Perfectly Efficiently.
J. Comput. Syst. Sci., 1996

1995
Learning Finite Binary Sequences from Half-Space Data.
Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995

1993
On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993


  Loading...