咨询与建议

限定检索结果

文献类型

  • 31 篇 期刊文献
  • 15 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 43 篇 工学
    • 38 篇 计算机科学与技术...
    • 27 篇 软件工程
    • 4 篇 电气工程
    • 3 篇 控制科学与工程
    • 2 篇 生物工程
    • 1 篇 仪器科学与技术
    • 1 篇 信息与通信工程
    • 1 篇 测绘科学与技术
    • 1 篇 航空宇航科学与技...
  • 21 篇 理学
    • 19 篇 数学
    • 2 篇 生物学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 46 篇 external memory ...
  • 6 篇 algorithms
  • 6 篇 suffix array
  • 5 篇 lcp array
  • 4 篇 graph algorithms
  • 3 篇 sorting
  • 3 篇 burrows-wheeler ...
  • 3 篇 data structures
  • 2 篇 ram algorithms
  • 2 篇 performance
  • 2 篇 clustering
  • 2 篇 parallel i/o
  • 2 篇 succinct data st...
  • 2 篇 lower bound
  • 2 篇 spatial database...
  • 2 篇 plane-sweep
  • 2 篇 spatial join
  • 2 篇 design
  • 2 篇 prefetching
  • 2 篇 minimum spanning...

机构

  • 3 篇 aarhus univ aarh...
  • 2 篇 carleton univ sc...
  • 2 篇 eth inst theoret...
  • 2 篇 univ copenhagen ...
  • 2 篇 univ estadual ca...
  • 2 篇 aarhus univ dept...
  • 2 篇 univ sao paulo d...
  • 2 篇 suny stony brook...
  • 1 篇 ncim grp eindhov...
  • 1 篇 carleton univ sc...
  • 1 篇 bosch telecom gm...
  • 1 篇 nyu ny usa
  • 1 篇 lawrence livermo...
  • 1 篇 univ minnesota m...
  • 1 篇 univ calif irvin...
  • 1 篇 department of co...
  • 1 篇 rutgers state un...
  • 1 篇 indian inst tech...
  • 1 篇 univ concepcion ...
  • 1 篇 univ piemonte or...

作者

  • 6 篇 kempa dominik
  • 4 篇 arge lars
  • 4 篇 karkkainen juha
  • 3 篇 kärkkäinen juha
  • 3 篇 van de pol jaco
  • 3 篇 yi ke
  • 3 篇 louza felipe a.
  • 3 篇 solvsten steffan...
  • 2 篇 brodal gerth sto...
  • 2 篇 manzini giovanni
  • 2 篇 zeh norbert
  • 2 篇 samet hanan
  • 2 篇 telles guilherme...
  • 2 篇 egidi lavinia
  • 2 篇 jacob riko
  • 2 篇 bender michael a...
  • 2 篇 vicari elias
  • 2 篇 maheshwari anil
  • 2 篇 mohanty sraban k...
  • 2 篇 abello j

语言

  • 45 篇 英文
  • 1 篇 其他
检索条件"主题词=External memory algorithms"
46 条 记 录,以下是1-10 订阅
排序:
Random Access on Narrow Decision Diagrams in external memory  30th
Random Access on Narrow Decision Diagrams in External Memory
收藏 引用
30th International Symposium on Model Checking Software
作者: Solvsten, Steffan Christ Rysgaarde, Casper Moldrup Van de Pol, Jaco Aarhus Univ Aarhus Denmark
The external memory BDD package Adiar can manipulate Binary Decision Diagrams (BDDs) larger than the RAM of the machine. To do so, it uses one or more priority queues to defer processing each recursion until the relev... 详细信息
来源: 评论
Adiar 1.1 Zero-Suppressed Decision Diagrams in external memory  15th
Adiar 1.1 Zero-Suppressed Decision Diagrams in External Memo...
收藏 引用
15th International Symposium on NASA Formal Methods (NFM)
作者: Solvsten, Steffan Christ van de Pol, Jaco Aarhus Univ Aarhus Denmark
We outline how support for Zero-suppressed Decision Diagrams (ZDDs) has been achieved for the external memory BDD package Adiar. This allows one to use ZDDs to solve various problems despite their size exceed the mach... 详细信息
来源: 评论
Adiar Binary Decision Diagrams in external memory  28th
Adiar Binary Decision Diagrams in External Memory
收藏 引用
28th International Conference on Tools and algorithms for the Construction and Analysis of Systems (TACAS) Held as Part of the 25th European Joint Conferences on Theory and Practice of Software (ETAPS)
作者: Solvsten, Steffan Christ van de Pol, Jaco Jakobsen, Anna Blume Thomasen, Mathias Weller Berg Aarhus Univ Aarhus Denmark
We follow up on the idea of Lars Arge to rephrase the Reduce and Apply operations of Binary Decision Diagrams (BDDs) as iterative I/O-efficient algorithms. We identify multiple avenues to simplify and improve the perf... 详细信息
来源: 评论
Belga B-Trees
收藏 引用
THEORY OF COMPUTING SYSTEMS 2021年 第3期65卷 541-558页
作者: Demaine, Erik D. Iacono, John Koumoutsos, Grigorios Langerman, Stefan MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA Univ Libre Bruxelles Brussels Belgium NYU New York NY USA Fonds Rech Sci FRS FNRS Brussels Belgium
We revisitself-adjustingexternal memory tree data structures, which combine the optimal (and practical) worst-case I/O performances of B-trees, while adapting to the online distribution of queries. Our approach is ana... 详细信息
来源: 评论
Better external memory LCP array construction
收藏 引用
ACM Journal of Experimental Algorithmics 2019年 第1期24卷 1-27页
作者: Kärkkäinen, Juha Kempa, Dominik Helsinki FI-00014 Finland
The suffix array, perhaps the most important data structure in modern string processing, needs to be augmented with the longest-common-prefix (LCP) array in many applications. Their construction is often a major bottl... 详细信息
来源: 评论
An SNN-DBSCAN Based Clustering Algorithm for Big Data  3rd
An SNN-DBSCAN Based Clustering Algorithm for Big Data
收藏 引用
3rd International Conference on Advanced Computing and Intelligent Engineering (ICACIE)
作者: Pandey, Sriniwas Samal, Mamata Mohanty, Sraban Kumar PDPM Indian Inst Informat Technol Design & Mfg Comp Sci & Engn Jabalpur 482005 Madhya Pradesh India
Clustering is a technique to partition data into different groups in such a way that data items in a group are more similar to each other than the data points in any other group. The assumption of infinite main memory... 详细信息
来源: 评论
An Input/Output Efficient Algorithm for Hessenberg Reduction
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2019年 第8期30卷 1279-1300页
作者: Mohanty, Sraban Kumar Sajith, G. PDPM Indian Inst Informat Technol Design & Mfg Comp Sci & Engn Jabalpur MP India Indian Inst Technol Guwahati Comp Sci & Engn Gauhati Assam India
Reduction of an N x N nonsymmetric matrix to Hessenberg form which takes O(N-3) flops and O(N-3/B) I/Os is a major performance bottleneck in the computing of its eigenvalues. Usually to improve the performance, this H... 详细信息
来源: 评论
Space-Efficient Merging of Succinct de Bruijn Graphs  26th
Space-Efficient Merging of Succinct de Bruijn Graphs
收藏 引用
26th International Symposium on String Processing and Information Retrieval (SPIRE)
作者: Egidi, Lavinia Louza, Felipe A. Manzini, Giovanni Univ Piemonte Orientale Alessandria Italy Univ Fed Uberlandia Fac Elect Engn Uberlandia MG Brazil IIT CNR Pisa Italy
We propose a new algorithm for merging succinct representations of de Bruijn graphs introduced in [Bowe et al. WABI 2012]. Our algorithm is based on the lightweight BWT merging approach by Holt and McMillan [Bionforma... 详细信息
来源: 评论
external memory BWT and LCP computation for sequence collections with applications
收藏 引用
algorithms FOR MOLECULAR BIOLOGY 2019年 第1期14卷 6-6页
作者: Egidi, Lavinia Louza, Felipe A. Manzini, Giovanni Telles, Guilherme P. Univ Piemonte Orientale DiSIT Viale Michel 11 I-15121 Alessandria Italy Univ Sao Paulo Dept Comp & Math Av Bandeirantes 3900 BR-14040901 Ribeirao Preto Brazil CNR IIT Via Moruzzi 1 I-56124 Pisa Italy Univ Estadual Campinas Inst Comp Av Albert Einstein 1251 BR-13083852 Campinas SP Brazil
BackgroundSequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations. Many compressed indices are based on the Burrows-... 详细信息
来源: 评论
An external-memory Algorithm for String Graph Construction
收藏 引用
ALGORITHMICA 2017年 第2期78卷 394-424页
作者: Bonizzoni, Paola Della Vedova, Gianluca Pirola, Yuri Previtali, Marco Rizzi, Raffaella Univ Milano Bicocca DISCo Milan Italy
Some recent results (Bauer et al. in algorithms in bioinformatics, Springer, Berlin, pp 326-337, 2012;Cox et al. in algorithms in bioinformatics, Springer, Berlin, pp. 214-224, 2012;Rosone and Sciortino in The nature ... 详细信息
来源: 评论