咨询与建议

限定检索结果

文献类型

  • 5,672 篇 会议
  • 3,456 篇 期刊文献
  • 41 篇 学位论文
  • 4 册 图书
  • 1 篇 资讯

馆藏范围

  • 9,174 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5,484 篇 工学
    • 4,478 篇 计算机科学与技术...
    • 1,617 篇 软件工程
    • 1,420 篇 电气工程
    • 448 篇 信息与通信工程
    • 296 篇 控制科学与工程
    • 268 篇 电子科学与技术(可...
    • 94 篇 仪器科学与技术
    • 75 篇 机械工程
    • 74 篇 力学(可授工学、理...
    • 63 篇 动力工程及工程热...
    • 63 篇 化学工程与技术
    • 61 篇 生物工程
    • 55 篇 生物医学工程(可授...
    • 51 篇 农业工程
    • 45 篇 材料科学与工程(可...
    • 44 篇 土木工程
    • 40 篇 光学工程
    • 30 篇 建筑学
  • 2,404 篇 理学
    • 1,984 篇 数学
    • 311 篇 物理学
    • 149 篇 统计学(可授理学、...
    • 113 篇 系统科学
    • 97 篇 生物学
    • 89 篇 化学
  • 506 篇 管理学
    • 390 篇 管理科学与工程(可...
    • 123 篇 图书情报与档案管...
    • 76 篇 工商管理
  • 81 篇 医学
    • 58 篇 临床医学
  • 68 篇 农学
    • 62 篇 作物学
  • 34 篇 经济学
    • 32 篇 应用经济学
  • 28 篇 法学
  • 13 篇 文学
  • 7 篇 教育学
  • 5 篇 艺术学
  • 4 篇 军事学

主题

  • 9,174 篇 parallel algorit...
  • 1,158 篇 concurrent compu...
  • 847 篇 algorithm design...
  • 672 篇 parallel process...
  • 616 篇 computer science
  • 460 篇 computational mo...
  • 374 篇 computer archite...
  • 289 篇 phase change ran...
  • 233 篇 application soft...
  • 224 篇 parallel archite...
  • 215 篇 hypercubes
  • 200 篇 very large scale...
  • 198 篇 costs
  • 196 篇 parallel program...
  • 176 篇 sorting
  • 175 篇 scalability
  • 165 篇 hardware
  • 152 篇 data mining
  • 147 篇 routing
  • 144 篇 clustering algor...

机构

  • 26 篇 carnegie mellon ...
  • 19 篇 school of electr...
  • 17 篇 department of co...
  • 17 篇 ibm thomas j. wa...
  • 16 篇 department of co...
  • 15 篇 old dominion uni...
  • 15 篇 hiroshima univ d...
  • 13 篇 purdue univ dept...
  • 13 篇 univ texas dept ...
  • 12 篇 georgia inst tec...
  • 12 篇 univ maryland de...
  • 12 篇 old dominion uni...
  • 12 篇 school of comput...
  • 11 篇 swiss fed inst t...
  • 11 篇 univ maryland co...
  • 11 篇 univ maryland in...
  • 10 篇 georgia inst tec...
  • 10 篇 department of co...
  • 10 篇 department of co...
  • 10 篇 eth zurich

作者

  • 35 篇 shun julian
  • 33 篇 olariu s
  • 30 篇 p. banerjee
  • 30 篇 blelloch guy e.
  • 26 篇 nakano koji
  • 24 篇 bader david a.
  • 18 篇 dhulipala laxman
  • 18 篇 gu yan
  • 17 篇 ito yasuaki
  • 16 篇 schwing jl
  • 15 篇 v. kumar
  • 15 篇 khan maleq
  • 14 篇 sun yihan
  • 14 篇 shi-jinn horng
  • 14 篇 vishkin uzi
  • 13 篇 ballard grey
  • 13 篇 takefuji y
  • 13 篇 banerjee p
  • 13 篇 han yj
  • 12 篇 ramachandran v

语言

  • 8,733 篇 英文
  • 361 篇 其他
  • 60 篇 中文
  • 9 篇 俄文
  • 4 篇 德文
  • 3 篇 西班牙文
  • 2 篇 法文
检索条件"主题词=Parallel algorithms"
9174 条 记 录,以下是581-590 订阅
排序:
A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints
收藏 引用
JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2020年 第0期137卷 246-251页
作者: Atighehchi, Kevin Univ Clermont Auvergne CNRS LIMOS F-63000 Clermont France
A recent work shows how we can optimize a tree based mode of operation for a hash function where the sizes of input message blocks and digest are the same, subject to the constraint that the involved tree structure ha... 详细信息
来源: 评论
Modeling, optimization and performance prediction of parallel algorithms
Modeling, optimization and performance prediction of paralle...
收藏 引用
IEEE Symposium on Computers and Communications (ISCC)
作者: Martin Húdik Michal Hodoň Department of Technical Cybernetics University of Žilina Žilina Slovakia
The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and cos... 详细信息
来源: 评论
Tight Analysis of parallel Randomized Greedy MIS
收藏 引用
ACM TRANSACTIONS ON algorithms 2020年 第1期16卷 6-6页
作者: Fischer, Manuela Noever, Andreas Swiss Fed Inst Technol Univ Str 6 CH-8092 Zurich Switzerland
We provide a tight analysis that settles the round complexity of the well-studied parallel randomized greedy MIS algorithm, thus answering the main open question of Blelloch, Fineman, and Shun [SPAA'12]. The paral... 详细信息
来源: 评论
Risk Prediction and Treatment in Enterprise Management Based on Ant Colony parallel Algorithm
Lecture Notes on Data Engineering and Communications Technol...
收藏 引用
Lecture Notes on Data Engineering and Communications Technologies 2022年 129卷 99-106页
作者: Shi, Kaixin TOJOY Wisdom Enterprise Service Co. Ltd. Shanghai China
As the global economy continues to grow, the business scope of enterprises is further expanded, the environment will become more complex, the risks they face will increase, and the uncertainty will gradually increase.... 详细信息
来源: 评论
parallel architecture to accelerate superparamagnetic clustering algorithm
收藏 引用
ELECTRONICS LETTERS 2020年 第14期56卷 701-+页
作者: Wang, Pan Ke Chen, Chang Hao Pun, Sio Hang Zhang, Baijun Mak, Peng Un Vai, Mang I. Lei, Tim C. Univ Macau Inst Microelect State Key Lab Analog & Mixed Signal VLSI Macau Peoples R China Univ Macau Dept Elect & Comp Engn Macau Peoples R China Sun Yat Sen Univ Sch Elect & Informat Technol State Key Lab Optoelect Mat & Technol Guangzhou Peoples R China Univ Colorado Dept Elect Engn Denver CO 80202 USA
Superparamagnetic clustering (SPC) is an unsupervised classification technique in which clusters are self-organised based on data density and mutual interaction energy. Traditional SPC algorithm uses the Swendsen-Wang... 详细信息
来源: 评论
Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits  22
Message Complexity of Multi-Valued Implicit Agreement with S...
收藏 引用
23rd International Conference on Distributed Computing and Networking, ICDCN 2022
作者: Bose, Kaustav Molla, Anisur Rahaman Advanced Computing and Microelectronics Unit Indian Statistical Institute India R. C. Bose Centre for Cryptology and Security Indian Statistical Institute India
An agreement protocol enables a system of n nodes in a distributed network to agree on a common input value. In the implicit version of the problem, only a subset of the nodes are required to decide the common value. ... 详细信息
来源: 评论
Speeding Up the Gomory-Hu parallel Cut Tree Algorithm with Efficient Graph Contractions
收藏 引用
ALGORITHMICA 2020年 第6期82卷 1601-1615页
作者: Maske, Charles Cohen, Jaime Duarte Jr, Elias P. Univ Fed Parana Dept Informat Curitiba Parana Brazil Univ Estadual Ponta Grossa Dept Informat Ponta Grossa Parana Brazil
A cut tree is a combinatorial structure that represents the edge-connectivity between all pairs of nodes of an undirected graph. Cut trees have multiple applications in dependability, as they represent how much it tak... 详细信息
来源: 评论
A Geometric Multigrid Method for Space-Time Finite Element Discretizations of the Navier-Stokes Equations and its Application to 3D Flow Simulation
收藏 引用
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 2023年 第1期49卷 5-5页
作者: Anselmann, Mathias Bause, Markus Helmut Schmidt Univ Fac Mech & Civil Engn Holstenhofweg 85 D-22043 Hamburg Germany
We present a parallelized geometric multigrid (GMG) method, based on the cell-based Vanka smoother, for higher order space-time finite element methods (STFEM) to the incompressible Navier-Stokes equations. The STFEM i... 详细信息
来源: 评论
Fast Grayscale Morphology for Circular Window
收藏 引用
COMPUTER GRAPHICS FORUM 2023年 第7期42卷 e14983-e14983页
作者: Moroto, Yuji Umetani, Nobuyuki Univ Tokyo Tokyo Japan
Morphological operations are among the most popular classic image filters. The filter assumes the maximum or minimum value within a window and is often used for light object thickening and thinning operations, which a... 详细信息
来源: 评论
A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2020年 第12期79卷 3495-3515页
作者: Acebron, Juan A. Herrero, Jose R. Monteiro, Jose ISCTE Univ Inst Lisbon Dept Informat Sci & Technol Lisbon Portugal Univ Lisbon Inst Super Tecn INESC ID Lisbon Portugal Univ Politecn Cataluna Dept Arquitectura Computadors Barcelona Spain
A novel algorithm for computing the action of a matrix exponential over a vector is proposed. The algorithm is based on a multilevel Monte Carlo method, and the vector solution is computed probabilistically generating... 详细信息
来源: 评论