Multiple search problem on reconfigurable meshes

被引:0
|
作者
Department of Computer Science, National Tsing Hua University, Hsinchu, 30043, Taiwan [1 ]
不详 [2 ]
机构
来源
Inf. Process. Lett. | / 2卷 / 65-69期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] Multiple search problem on reconfigurable meshes
    Chao, CC
    Chen, WT
    Chen, GH
    INFORMATION PROCESSING LETTERS, 1996, 58 (02) : 65 - 69
  • [2] Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications
    Bokka, V
    Nakano, K
    Olariu, S
    Schwing, JL
    Wilson, L
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, 12 (09) : 875 - 887
  • [3] Parallel progressive multiple sequence alignment on reconfigurable meshes
    Ken D Nguyen
    Yi Pan
    Ge Nong
    BMC Genomics, 12
  • [4] Parallel progressive multiple sequence alignment on reconfigurable meshes
    Nguyen, Ken D.
    Pan, Yi
    Nong, Ge
    BMC GENOMICS, 2011, 12
  • [5] Reconfigurable meshes with reconfigurable switches
    Moreira, A
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 538 - 545
  • [6] OPTIMAL SIMULATION OF MULTIDIMENSIONAL RECONFIGURABLE MESHES BY 2-DIMENSIONAL RECONFIGURABLE MESHES
    VAIDYANATHAN, R
    TRAHAN, JL
    INFORMATION PROCESSING LETTERS, 1993, 47 (05) : 267 - 273
  • [7] Scaling-simulation of linear reconfigurable meshes by horizontal-vertical reconfigurable meshes
    Matsumae, S
    PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3, 2005, : 533 - 539
  • [8] Permutation Routing on Reconfigurable Meshes
    J. C. Cogolludo
    S. Rajasekaran
    Algorithmica, 2001, 31 : 44 - 57
  • [9] HOUGH TRANSFORM ON RECONFIGURABLE MESHES
    CHUNG, KL
    LIN, HY
    COMPUTER VISION AND IMAGE UNDERSTANDING, 1995, 61 (02) : 278 - 284
  • [10] Permutation routing on reconfigurable meshes
    Cogolludo, JC
    Rajasekaran, S
    ALGORITHMICA, 2001, 31 (01) : 44 - 57