咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 3 篇 distributed-memo...
  • 1 篇 parallel algorit...
  • 1 篇 approximation al...
  • 1 篇 sparse matrices
  • 1 篇 cardinality matc...
  • 1 篇 automatic differ...
  • 1 篇 distance-2 graph...
  • 1 篇 combinatorial sc...
  • 1 篇 matrices
  • 1 篇 jacobian computa...
  • 1 篇 pattern matching
  • 1 篇 maximal cardinal...
  • 1 篇 graph-based algo...
  • 1 篇 bipartite graph
  • 1 篇 matching
  • 1 篇 hessian computat...
  • 1 篇 cray xc30 superc...
  • 1 篇 processor counts
  • 1 篇 low-rank approxi...
  • 1 篇 graph theory

机构

  • 1 篇 wake forest univ...
  • 1 篇 ohio state univ ...
  • 1 篇 georgia inst tec...
  • 1 篇 sandia natl labs...
  • 1 篇 lawrence berkele...
  • 1 篇 ohio state univ ...
  • 1 篇 univ bergen dept...
  • 1 篇 oak ridge natl l...
  • 1 篇 purdue univ dept...

作者

  • 1 篇 ballard grey
  • 1 篇 ozguner fuesun
  • 1 篇 boman erik g.
  • 1 篇 gebremedhin asse...
  • 1 篇 azad ariful
  • 1 篇 bozdag doruk
  • 1 篇 manne fredrik
  • 1 篇 buluc aydin
  • 1 篇 catalyurek uemit...
  • 1 篇 manning lawton
  • 1 篇 kannan ramakrish...
  • 1 篇 park haesun

语言

  • 3 篇 英文
检索条件"主题词=distributed-memory parallel algorithms"
3 条 记 录,以下是1-10 订阅
排序:
distributed-memory parallel algorithms FOR DISTANCE-2 COLORING AND RELATED PROBLEMS IN DERIVATIVE COMPUTATION
收藏 引用
SIAM JOURNAL ON SCIENTIFIC COMPUTING 2010年 第4期32卷 2418-2446页
作者: Bozdag, Doruk Catalyurek, Uemit V. Gebremedhin, Assefaw H. Manne, Fredrik Boman, Erik G. Ozguner, Fuesun Ohio State Univ Dept Biomed Informat Columbus OH 43210 USA Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Univ Bergen Dept Informat N-5008 Bergen Norway Sandia Natl Labs Scalable Algorithms Dept Albuquerque NM 87185 USA
The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than 2 from each other. Its applications include derivative... 详细信息
来源: 评论
distributed-memory algorithms for Maximal Cardinality Matching using Matrix Algebra
Distributed-Memory Algorithms for Maximal Cardinality Matchi...
收藏 引用
IEEE International Conference on Cluster Computing (CLUSTER)
作者: Azad, Ariful Buluc, Aydin Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA 94720 USA
We design and implement distributed-memory parallel algorithms for computing maximal cardinality matching in a bipartite graph. Relying on matrix algebra building blocks, our algorithms expose a higher degree of paral... 详细信息
来源: 评论
parallel Hierarchical Clustering using Rank-Two Nonnegative Matrix Factorization  27
Parallel Hierarchical Clustering using Rank-Two Nonnegative ...
收藏 引用
27th IEEE International Conference on High Performance Computing, Data, and Analytics (HiPC)
作者: Manning, Lawton Ballard, Grey Kannan, Ramakrishnan Park, Haesun Wake Forest Univ Winston Salem NC 27101 USA Oak Ridge Natl Lab Oak Ridge TN USA Georgia Inst Technol Atlanta GA 30332 USA
Nonnegative Matrix Factorization (NMF) is an effective tool for clustering nonnegative data, either for computing a flat partitioning of a dataset or for determining a hierarchy of similarity. In this paper, we propos... 详细信息
来源: 评论