
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Venkatavasu Bokka, Koji Nakano, Stephen Olariu, James L. Schwing, Larry Wilson, "Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 9, pp. 875887, September, 2001.  
BibTex  x  
@article{ 10.1109/71.954618, author = {Venkatavasu Bokka and Koji Nakano and Stephen Olariu and James L. Schwing and Larry Wilson}, title = {Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {9}, issn = {10459219}, year = {2001}, pages = {875887}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.954618}, 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  Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications IS  9 SN  10459219 SP875 EP887 EPD  875887 A1  Venkatavasu Bokka, A1  Koji Nakano, A1  Stephen Olariu, A1  James L. Schwing, A1  Larry Wilson, PY  2001 KW  Query processing KW  reconfigurable mesh KW  database design KW  pattern recognition KW  image processing KW  computational geometry KW  robotics KW  morphology KW  parallel algorithms. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The main contribution of this work is to show that a number of fundamental and seemingly unrelated problems in database design, pattern recognition, robotics, computational geometry, and image processing can be solved simply and elegantly by stating them as instances of a unifying algorithmic framework that we call the Multiple Query problem. The Multiple Query problem (MQ, for short) is a 5tuple
[1] S.G. Akl and K.A. Lyons, Parallel Computational Geometry, Prentice Hall, Englewood Cliffs, N.J., 1993.
[2] D.H. Ballard and C.M. Brown, Computer Vision, Prentice Hall, Upper Saddle River, N.J., 1982.
[3] Y.C. Chen and W.T. Cheng, “Reconfigurable Mesh Algorithms for Summing up Binary Values and Its Applications,” Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 427433, 1992.
[4] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: Wiley and Sons, 1973.
[5] J.D. Foley,A. van Dam,S.K. Feiner,, and J.F. Hughes,Computer Graphics: Principles and Practice,Menlo Park, Calif.: AddisonWesley, 1990.
[6] J. Jang, H. Park, and V.K. Prasanna, "A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 97106, Feb. 1995.
[7] J. Jenq and S. Sahni,“Histogramming on a reconfigurable mesh computer,” Proc. Int’l Parallel Processing Symp., pp. 425432, 1992.
[8] C.S. Jeong and D.T. Lee, “Parallel Geometric Algorithms on a MeshConnected Computer,” Algorithmica, vol. 5, pp. 155177, 1990.
[9] J.P. Laumond, "Obstacle Growing in a NonPolygonal World," Information Processing Letters, vol. 25, pp. 4150, 1987.
[10] H. Li and M. Maresca,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[11] T. LozanoPerez, “Spatial Planning: A Configurational Space Approach,” IEEE Trans. Computers, vol. 32, pp. 108119, 1983.
[12] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 1993.
[13] M. Maresca, H. Li, and P. Baglietto, “Hardware Support for Fast Reconfigurability in Processor Arrays,” Proc. Int'l Conf. Parallel Processing, vol. I, pp. 282289, 1993.
[14] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678692, June 1993.
[15] K. Nakano, “A Bibliography of Published Papers on Dynamically Reconfigurable Architectures,” Parallel Processing Letters, vol. 5, pp. 111124, 1995.
[16] K. Nakano and S. Olariu, “An Efficient Algorithm for Row Minima Computations on Basic Recofigurable Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, pp. 561569, 1998.
[17] K. Nakano and K. Wada, ”Integer Summing Algorithms on Reconfigurable Meshes,“ Theoretical Computer Science, vol. 197, pp. 5777, 1998.
[18] S. Olariu, J.L. Schwing, and J. Zhang, “Optimal Convex Hull Algorithms on Enhanced Meshes,” BIT vol. 33, pp. 396410, 1993.
[19] S. Olariu, J.L. Schwing, and J. Zhang, "Fast Computer Vision Algorithms for Reconfigurable Meshes," Proc. Int'l Parallel Processing Symp., pp. 258261, 1992.
[20] B.T. Preas and M.J.Lorenzetti eds. Physical Design Automation of VLSI Systems, Menlo Park: Benjamin/Cummings, 1988.
[21] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[22] J. Serra, Image Analysis and Mathematical Morphology. New York: Academic Press, 1982.
[23] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.