![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. John M. Conroy 3 John M. Conroy, Dianne P. O'Leary : Text Summarization via Hidden Markov Models. SIGIR 2001 : 406-407 2 Raymond R. Glenn , Daniel V. Pryor , John M. Conroy, Theodore Johnson : Characterizing memory hot spots in a shared memory MIMD machine. SC 1991 : 554-566 1 David A. Carlson , John M. Conroy: The fast fourier transform and sparse matrix computations: a study of two applications on teh HORIZON supercomputer. SC 1988 : 55-58 ![]() DiSC'02 © 2003 Association for Computing Machinery |