咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 3 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 2 篇 理学
    • 2 篇 数学

主题

  • 3 篇 input/output com...
  • 2 篇 computational th...
  • 2 篇 computational mo...
  • 1 篇 external searchi...
  • 1 篇 redundancy
  • 1 篇 isothetic hyperc...
  • 1 篇 blocking

机构

  • 2 篇 chinese acad sci...
  • 1 篇 harbin inst tech...
  • 1 篇 johns hopkins un...
  • 1 篇 harbin inst tech...
  • 1 篇 duke univ dept c...

作者

  • 2 篇 gao tianpeng
  • 2 篇 li jianzhong
  • 2 篇 gao xiangyu
  • 2 篇 ma hengzhao
  • 1 篇 vitter js
  • 1 篇 nodine mh
  • 1 篇 goodrich mt

语言

  • 3 篇 英文
检索条件"主题词=Input/output complexity"
3 条 记 录,以下是1-10 订阅
排序:
Turing Machines with Two-Level Memory: A Deep Look into the input/output complexity  28th
Turing Machines with Two-Level Memory: A Deep Look into the ...
收藏 引用
28th International Computing and Combinatorics Conference (COCOON)
作者: Ma, Hengzhao Li, Jianzhong Gao, Xiangyu Gao, Tianpeng Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Harbin Inst Technol Harbin Peoples R China
The input/output complexity, which is the complexity of data exchange between the main memory and the external memory, has been elaborately studied by a lot of former researchers. However, the existing works failed to... 详细信息
来源: 评论
Turing machines with two-level memory: New computational models for analyzing the input/output complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 985卷
作者: Ma, Hengzhao Li, Jianzhong Gao, Tianpeng Gao, Xiangyu Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Harbin Inst Technol Weihai Peoples R China
The input/output complexity, which is the complexity of data exchange between the main memory and the external memory, has been elaborately studied by a lot of former researchers. However, the existing works failed to... 详细信息
来源: 评论
Blocking for external graph searching
收藏 引用
ALGORITHMICA 1996年 第2期16卷 181-214页
作者: Nodine, MH Goodrich, MT Vitter, JS JOHNS HOPKINS UNIV DEPT COMP SCI BALTIMORE MD 21218 USA DUKE UNIV DEPT COMP SCI DURHAM NC 27708 USA
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented any number of times on the disk in o... 详细信息
来源: 评论