We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
- We investigate extensions of the classical measurement of effectiveness in information retrieval systems, precision and recall, to situations where the answer is modeled by a fuz...
In many applications, objects are represented by a collection of unorganized points that scan the surface of the object. In such cases, an efficient way of storing this information...
The first available genome of a multicellular organism, C. elegans, was used as a test case for protein fold assignment using PSI-BLAST, followed by rational structure modeling an...
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...