Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
We construct fault-tolerant routings for several families of graphs, including all graphs of maximal degree less than cn 1 3 for some c>0. With these routings, the diameter of the surviving graph is bounded by a constant (e.g., 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of Dolev et al. (1984, in "Proceedings, 16th ACM Symp. on Theory of Comput.," pp. 526-535). © 1987.
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
B.K. Boguraev, Mary S. Neff
HICSS 2000
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory