
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hussein M. Alnuweiri, "Parallel ConstantTime Connectivity Algorithms on a Reconfigurable Network of Processors," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 1, pp. 105110, January, 1995.  
BibTex  x  
@article{ 10.1109/71.363405, author = {Hussein M. Alnuweiri}, title = {Parallel ConstantTime Connectivity Algorithms on a Reconfigurable Network of Processors}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {1}, issn = {10459219}, year = {1995}, pages = {105110}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.363405}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Parallel ConstantTime Connectivity Algorithms on a Reconfigurable Network of Processors IS  1 SN  10459219 SP105 EP110 EPD  105110 A1  Hussein M. Alnuweiri, PY  1995 VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] H. M. Alnuweiri,“Constant time image labeling on a reconfigurable processor array,”inProc. Int. Workshop on Comput. Architecture for Machine Perception, Paris, France, Dec. 1991.
[2] ——,“Constanttime parallel algorithms for image labeling on a reconfigurable network of processors,”IEEE Trans. Parallel Distrib. Syst., vol. 5, no. 3, pp. 320–326, Mar. 1994.
[3] H. M. Alnuweiri,“Optimal constanttime connectivity algorithms on a reconfigurable network of processors,”Tech. Rep., CICSRTR92014, UBC, Vancouver, Canada.
[4] H. M. Alnuweiri and V. K. Prasanna Kumar,“Parallel architectures and algorithms for image component labeling,”IEEE Trans. Pattern Anal. Machine Intell., vol. 14, pp. 1014–1034, Oct. 1992.
[5] M. R. Boseet al.,“Bounds for binary codes of length less than 25,”IEEE Trans. Inform. Theory, vol. IT24, no. 1, pp. 81–93, Jan. 1978.
[6] A. E. Brouwer,“A few new constant weight codes,”IEEE Trans. Inform. Theory, vol. IT26, no. 3, pp. 366, May 1980.
[7] F.Y. Chin, J. Lam, and I. Chen, "Efficient Parallel Algorithms for Some Graph Problems," Comm. ACM, vol. 25, no. 9, pp. 659665, 1982.
[8] J. Jang, H. Park, and K. Prasanna,“A fast algorithm for computing histogram on reconfigurable mesh,”Tech. Rep., IRIS 290, USC, Los Angeles, CA, 1992.
[9] R. L. Graham, D. E. Knuth, and O. Patashnik,Concrete Mathematics. Reading, MA: AddisonWesley, 1989.
[10] R. L. Graham and N. J. A. Sloane,“Lower bounds for constant weight codes,”IEEE Trans. Inform. Theory, vol. IT26, no. 1, pp. 37–42, Jan. 1980.
[11] J.F. Jeng and S. Sahni,“Reconfigurable mesh algorithms for the hough transform,”inProc. Int. Conf. Parallel Processing, 1991, pp. III34–III41.
[12] R. E. Kibler,“Some new constant weight codes,”IEEE Trans. Inform. Theory, vol. IT26, no. 3, pp. 364–365, 1980.
[13] M. Maresca and H. Li,“Connection autonomy in SIMD computers: a VLSI implementation,”J. Parallel Distribut. Comput., vol. 7, pp. 302–320, 1989.
[14] R. Miller,V.K. Prasanna Kumar,D.I. Reisis,, and Q.F. Stout,“Meshes with reconfigurable buses,” MIT Conf. on Advanced Research in VLSI, pp. 163178, 1988.
[15] K. Nakano, T. Masuzawa, and N. Tokura,“A fast sorting algorithm on a reconfigurable array,”inProc. COMP 90, 1990, pp. 71–78.
[16] S. Olariu, J. L. Schwing, and J. Zhang,“Efficient image processing algorithms for reconfigurable meshes,”inProc. AI/GI/VI Conf. '92, Vancouver, Canada, 1992.
[17] D.B. Shu, G. Nash, and C. Weems, "Image Understanding Architecture and Applications," Advances in Machine Vision, J.L.C. Sanz, ed., pp. 297355.New York: SpringerVerlag, 1989.
[18] T. D. Simon,“A fast static CMOS NOR gate,”inProc. Brown/MIT Conf. Advanced Res. in VLSI and Parallel Syst., 1992, pp. 180–192.
[19] B. F. Wang, C. J. Lu, and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor array with reconfigurable bus system,”IEEE Trans. Parallel Distrib. Syst., vol. 1, pp. 500–507, 1990.