Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
An algorithm is given for computing the transitive closure of a binary relation that is represented by a Boolean matrix. The algorithm is similar to Warshall's although it executes faster for sparse matrices on most computers, particularly in a paging environment. © 1975, ACM. All rights reserved.
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007