3 Hits in 0.69 sec

Page 5368 of Mathematical Reviews Vol. , Issue 90I [page]

1990 Mathematical Reviews  
(p. 85); K. Moidin Mohiuddin, Opportunities and constraints of parallel computing (pp. 87-88); John Y. Ngai and Charles L. Seitz, Adaptive routing in multicom- puter networks (pp. 89-92); Rishiyur S.  ...  Chan, The physics of the parallel machines (pp. 15-20); K.  ... 

An experimental HMM-based postal OCR system

A. Kornai
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing  
Mohiuddin, and Thomas Truong. tablewe report the average number of alternatives separately.  ...  In the nal stage of feature extraction this sequence v 0 ; v 1 ; :::; v k is rst triplicated, meaning that each v i is replaced by a concatenation v i 1 ; v i ; v i +1 .  ... 
doi:10.1109/icassp.1997.595467 dblp:conf/icassp/Kornai97 fatcat:3t5k5ckcvzbgdjlzlly3h3dycy

An approximation to the greedy algorithm for differential compression

R. C. Agarwal, K. Gupta, S. Jain, S. Amalapurapu
2006 IBM Journal of Research and Development  
We thank Dharmendra Modha and Moidin Mohiuddin for their tremendous assistance and helpful conversations.  ...  After the nth pass of the algorithm, if there are values c k that are between c i and c j in the partially sorted array, c i ¼ nÀ1 c k ¼ nÀ1 c j for all such c k .  ...  The total length of the reference file offset stream is d(k/8) Á dlog 2 mee, where k is the number of reference file tokens.  ... 
doi:10.1147/rd.501.0149 fatcat:iuhuu4df3zffbdxi6utb5xyecq