咨询与建议

限定检索结果

文献类型

  • 416 篇 会议
  • 20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 306 篇 工学
    • 299 篇 计算机科学与技术...
    • 192 篇 软件工程
    • 31 篇 电气工程
    • 27 篇 信息与通信工程
    • 20 篇 控制科学与工程
    • 9 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 4 篇 生物医学工程(可授...
    • 4 篇 生物工程
    • 3 篇 机械工程
    • 3 篇 光学工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 化学工程与技术
    • 1 篇 环境科学与工程(可...
  • 172 篇 理学
    • 165 篇 数学
    • 25 篇 统计学(可授理学、...
    • 4 篇 生物学
    • 3 篇 物理学
    • 3 篇 系统科学
    • 1 篇 化学
  • 16 篇 管理学
    • 13 篇 管理科学与工程(可...
    • 11 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 6 篇 农学
    • 6 篇 作物学
    • 2 篇 农业资源与环境
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 92 篇 parallel algorit...
  • 81 篇 parallel process...
  • 14 篇 parallel program...
  • 13 篇 computer program...
  • 10 篇 computer archite...
  • 10 篇 scheduling
  • 8 篇 computer systems...
  • 8 篇 pram
  • 7 篇 parallel process...
  • 6 篇 parallel archite...
  • 5 篇 graph algorithms
  • 5 篇 multithreading
  • 4 篇 performance
  • 4 篇 approximation al...
  • 4 篇 computational ge...
  • 4 篇 bandwidth
  • 4 篇 processor schedu...
  • 4 篇 pipeline process...
  • 4 篇 transactional me...
  • 4 篇 concurrency

机构

  • 11 篇 carnegie mellon ...
  • 4 篇 univ maryland de...
  • 4 篇 carnegie mellon ...
  • 4 篇 univ of paderbor...
  • 3 篇 carnegie mellon ...
  • 3 篇 department of co...
  • 3 篇 university of ma...
  • 3 篇 mit 77 massachus...
  • 2 篇 duke univ durham...
  • 2 篇 univ calif river...
  • 2 篇 carnegie mellon ...
  • 2 篇 univ of toronto ...
  • 2 篇 dipartimento di ...
  • 2 篇 dept. of compute...
  • 2 篇 at and t bell la...
  • 2 篇 sandia national ...
  • 2 篇 ibm t.j. watson ...
  • 2 篇 computer science...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...

作者

  • 12 篇 blelloch guy e.
  • 12 篇 gibbons phillip ...
  • 6 篇 reif john h.
  • 6 篇 leiserson charle...
  • 5 篇 muthukrishnan s.
  • 5 篇 goodrich michael...
  • 5 篇 matias yossi
  • 4 篇 uzi vishkin
  • 4 篇 ramachandran vij...
  • 4 篇 tangwongsan kana...
  • 4 篇 vitter jeffrey s...
  • 4 篇 simhadri harsha ...
  • 4 篇 gu yan
  • 4 篇 phillip b. gibbo...
  • 3 篇 snir marc
  • 3 篇 tarjan robert e.
  • 3 篇 cormen thomas h.
  • 3 篇 dhulipala laxman
  • 3 篇 deng xiaotie
  • 3 篇 monien burkhard

语言

  • 422 篇 英文
  • 14 篇 其他
检索条件"任意字段=Proceedings of the second annual ACM symposium on Parallel algorithms and architectures"
436 条 记 录,以下是31-40 订阅
排序:
ParGeo: A Library for parallel Computational Geometry  30
ParGeo: A Library for Parallel Computational Geometry
收藏 引用
30th annual European symposium on algorithms, ESA 2022
作者: Wang, Yiqiu Yesantharao, Rahul Yu, Shangdi Dhulipala, Laxman Gu, Yan Shun, Julian CSAIL MIT CambridgeMA United States University of Maryland College ParkMD United States University of California RiversideCA United States
This paper presents ParGeo, a multicore library for computational geometry. ParGeo contains modules for fundamental tasks including kd-tree based spatial search, spatial graph generation, and algorithms in computation... 详细信息
来源: 评论
SPAA 2020 - proceedings of the 32nd acm symposium on parallelism in algorithms and architectures
SPAA 2020 - Proceedings of the 32nd ACM Symposium on Paralle...
收藏 引用
32nd acm symposium on parallelism in algorithms and architectures, SPAA 2020
The proceedings contain 68 papers. The topics discussed include: faster deterministic all pairs shortest paths in congest model;contention resolution with message deadlines;memory tagging: minimalist synchronization f...
来源: 评论
Cache-Efficient parallel-Partition algorithms using Exclusive-Read-and-Write Memory  20
Cache-Efficient Parallel-Partition Algorithms using Exclusiv...
收藏 引用
32nd acm symposium on parallelism in algorithms and architectures, SPAA 2020
作者: Kuszmaul, William Westover, Alek Massachusetts Institute of Technology BostonMA United States Belmont High School BostonMA United States
We present an in-place algorithm for the parallel-partition problem with linear work and polylogarithmic span. The algorithm uses only exclusive read/write shared variables and can be implemented using parallel-for-lo... 详细信息
来源: 评论
Privacy Preserving Cooperative Computation for Personalized Web Search Applications  20
Privacy Preserving Cooperative Computation for Personalized ...
收藏 引用
35th annual acm symposium on Applied Computing (SAC)
作者: Kaaniche, Nesrine Masmoudi, Souha Znina, Souha Laurent, Maryline Demir, Levent Univ Sheffield Dept Comp Sci Sheffield S Yorkshire England Inst Polytech Paris Telecom SudParis Evry France Inst Polytech Paris Telecom SudParis Chair Values & Policies Personal Informat SAMOVAR Evry France Qwant Res Paris France
With the emergence of connected objects and the development of Artificial Intelligence (AI) mechanisms and algorithms, personalized applications are gaining an expanding interest, providing services tailored to each s... 详细信息
来源: 评论
A time-optimal randomized parallel algorithm for MIS  21
A time-optimal randomized parallel algorithm for MIS
收藏 引用
proceedings of the Thirty-second annual acm-SIAM symposium on Discrete algorithms
作者: Mohsen Ghaffari Bernhard Haeupler ETH Zurich Carnegie Mellon University
We present a randomized parallel algorithm, in the Exclusive-Read Exclusive-Write (EREW) PRAM model, that computes a Maximal Independent Set (MIS) in O(log n) time and using O(m log2 n) work, with high probability. Th...
来源: 评论
Dynamic graph algorithms with batch updates in the massively parallel computation model  21
Dynamic graph algorithms with batch updates in the massively...
收藏 引用
proceedings of the Thirty-second annual acm-SIAM symposium on Discrete algorithms
作者: Krzysztof Nowicki Krzysztof Onak University of Wroclaw and IBM T.J. Watson Research Center IBM Research
We study dynamic graph algorithms in the Massively parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of ed...
来源: 评论
Tight bounds for parallel paging and green paging  21
Tight bounds for parallel paging and green paging
收藏 引用
proceedings of the Thirty-second annual acm-SIAM symposium on Discrete algorithms
作者: Kunal Agrawal Michael A. Bender Rathish Das William Kuszmaul Enoch Peserico Michele Scquizzato Washington University in St. Louis Stony Brook University MIT Università degli Studi di Padova Italy
In the parallel paging problem, there are p processors that share a cache of size k. The goal is to partition the cache among the processors over time in order to minimize their average completion time. For this long-...
来源: 评论
annual acm symposium on parallelism in algorithms and architectures
Annual ACM Symposium on Parallelism in Algorithms and Archit...
收藏 引用
31st acm symposium on parallelism in algorithms and architectures, SPAA 2019
The proceedings contain 45 papers. The topics discussed include: the price of clustering in bin-packing with applications to bin-packing with delays;faster matrix multiplication via sparse decomposition;NC algorithms ...
来源: 评论
A deterministic parallel APSP algorithm and its applications  21
A deterministic parallel APSP algorithm and its applications
收藏 引用
proceedings of the Thirty-second annual acm-SIAM symposium on Discrete algorithms
作者: Adam Karczmarz Piotr Sankowski University of Warsaw Poland
In this paper we show a deterministic parallel all-pairs shortest paths algorithm for real-weighted directed graphs. The algorithm has Õ(nm + (n/d)3) work and Õ(d) depth for any depth parameter d ∈ [1, n]. ...
来源: 评论
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovasz Local Lemma  30
Oblivious resampling oracles and parallel algorithms for the...
收藏 引用
30th annual acm-SIAM symposium on Discrete algorithms (SODA)
作者: Harris, David G. Univ Maryland Dept Comp Sci College Pk MD 20742 USA
The Lovasz Local Lemma (LLL) is a probabilistic tool which shows that, if a collection of \bad" events B in a probability space are not too likely and not too interdependent, then there is a positive probability ... 详细信息
来源: 评论