Time-Optimal Proximity Graph Computations on Enhanced Meshes

被引:0
|
作者
机构
来源
J. Parallel Distrib. Comput. | / 2卷 / 204-217期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] Time-optimal proximity graph computations on enhanced meshes
    Olariu, S
    Stojmenovic, I
    Zomaya, AY
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 49 (02) : 204 - 217
  • [2] Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes
    J Parallel Distrib Comput, 2 (144):
  • [3] Podality-based time-optimal computations on enhanced meshes
    Bokka, V
    Gurla, H
    Olariu, S
    Schwing, JL
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (10) : 1019 - 1035
  • [4] Time-optimal nearest-neighbor computations on enhanced meshes
    Olariu, S
    Stojmenovic, I
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 36 (02) : 144 - 155
  • [5] Time-optimal tree computations on sparse meshes
    Bhagavathi, D
    Bokka, V
    Gurla, H
    Olariu, S
    Schwing, JL
    DISCRETE APPLIED MATHEMATICS, 1997, 77 (03) : 201 - 220
  • [6] Time-optimal domain-specific querying on enhanced meshes
    Bokka, V
    Gurla, H
    Olariu, S
    Schwing, JL
    Wilson, L
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (01) : 13 - 24
  • [7] A TIME-OPTIMAL MULTIPLE SEARCH ALGORITHM ON ENHANCED MESHES, WITH APPLICATIONS
    BHAGAVATHI, D
    OLARIU, S
    SHEN, W
    WILSON, L
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 22 (01) : 113 - 120
  • [8] Computations and time-optimal controls
    Univ of Western Australia, Nedlands
    Optimal Control Applications and Methods, 1996, 17 (03): : 171 - 185
  • [9] Computations and time-optimal controls
    Kaya, CY
    Noakes, JL
    OPTIMAL CONTROL APPLICATIONS & METHODS, 1996, 17 (03): : 171 - 185
  • [10] TIME-OPTIMAL DIGITAL GEOMETRY ALGORITHMS ON MESHES WITH MULTIPLE BROADCASTING
    BOKKA, V
    GURLA, H
    OLARIU, S
    SCHWING, JL
    STOJMENOVIC, I
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 1995, 9 (04) : 601 - 613