咨询与建议

限定检索结果

文献类型

  • 81 篇 会议
  • 49 篇 期刊文献
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 76 篇 工学
    • 69 篇 计算机科学与技术...
    • 47 篇 软件工程
    • 14 篇 信息与通信工程
    • 12 篇 控制科学与工程
    • 10 篇 电气工程
    • 6 篇 动力工程及工程热...
    • 6 篇 生物工程
    • 4 篇 力学(可授工学、理...
    • 4 篇 机械工程
    • 4 篇 电子科学与技术(可...
    • 4 篇 环境科学与工程(可...
    • 3 篇 交通运输工程
    • 3 篇 生物医学工程(可授...
    • 3 篇 网络空间安全
  • 39 篇 理学
    • 27 篇 数学
    • 7 篇 物理学
    • 6 篇 化学
    • 6 篇 生物学
    • 5 篇 系统科学
    • 5 篇 统计学(可授理学、...
  • 20 篇 管理学
    • 14 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 7 篇 图书情报与档案管...
  • 5 篇 法学
    • 3 篇 社会学
    • 2 篇 法学
  • 4 篇 医学
    • 3 篇 基础医学(可授医学...
    • 3 篇 临床医学
    • 3 篇 公共卫生与预防医...
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 3 篇 教育学
    • 3 篇 教育学
  • 2 篇 农学
  • 1 篇 艺术学

主题

  • 18 篇 distributed comp...
  • 13 篇 concurrent compu...
  • 9 篇 computer science
  • 9 篇 parallel algorit...
  • 8 篇 machine learning
  • 7 篇 computer network...
  • 5 篇 grid computing
  • 5 篇 quality of servi...
  • 4 篇 deep learning
  • 4 篇 throughput
  • 4 篇 algorithm design...
  • 4 篇 cloud computing
  • 3 篇 runtime
  • 3 篇 parallel process...
  • 3 篇 scheduling algor...
  • 3 篇 phase change ran...
  • 3 篇 resource managem...
  • 3 篇 interference
  • 3 篇 pattern recognit...
  • 3 篇 load management

机构

  • 8 篇 school of comput...
  • 7 篇 school of cyber ...
  • 5 篇 parallel and dis...
  • 5 篇 department of co...
  • 5 篇 parallel and dis...
  • 5 篇 intelligent dist...
  • 4 篇 center for paral...
  • 4 篇 center for resea...
  • 4 篇 high performance...
  • 4 篇 mitsubishi elect...
  • 4 篇 beijing computat...
  • 4 篇 national researc...
  • 4 篇 national water a...
  • 3 篇 center for appli...
  • 3 篇 machine intellig...
  • 3 篇 high-performance...
  • 3 篇 laboratory schoo...
  • 3 篇 school of electr...
  • 3 篇 raygun performan...
  • 3 篇 faculty of compu...

作者

  • 9 篇 li kuan-ching
  • 9 篇 yang chao-tung
  • 8 篇 ismail leila
  • 7 篇 materwala huned
  • 7 篇 jin hai
  • 6 篇 s.k. das
  • 6 篇 leila ismail
  • 6 篇 das sajal k.
  • 5 篇 kuan-ching li
  • 5 篇 hsu ching-hsien
  • 5 篇 chao-tung yang
  • 4 篇 rajkumar buyya
  • 4 篇 zou deqing
  • 3 篇 zhang zhimin
  • 3 篇 chen ningjiang
  • 3 篇 parlikad ajith k...
  • 3 篇 p. banerjee
  • 3 篇 li zhen
  • 3 篇 arora priyansh
  • 3 篇 dustdar schahram

语言

  • 128 篇 英文
  • 3 篇 其他
检索条件"机构=Center for Research in Parallel and Distributed Computing Department of Computer Science"
131 条 记 录,以下是1-10 订阅
排序:
An End-to-End Classification Network Model Based on Hybrid Supervision for Industrial Surface Defect Detection
收藏 引用
International Journal of Pattern Recognition and Artificial Intelligence 2025年 第5期39卷
作者: Qin, Runbing Chen, Ningjiang Gan, Shukun Guangxi University School of Computer Electronics and Information Nanning530004 China Education Department of Guangxi Zhuang Autonomous Region Key Laboratory of Parallel Distributed and Intelligent Computing Guangxi University Nanning530004 China Guangxi Intelligent Digital Services Research Center of Engineering Technology Nanning530004 China
Industrial part surface defect detection aims to precisely locate defects in images, which is crucial for quality control in manufacturing. The traditional method needs to be designed in advance, but it has shortcomin... 详细信息
来源: 评论
PERFORMANCE OF parallel SPANNING TREE ALGORITHMS ON LINEAR ARRAYS OF TRANSPUTERS AND UNIX SYSTEMS
收藏 引用
parallel computing 1991年 第4-5期17卷 527-551页
作者: DAS, SK YANG, CQ Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas P.O. Box 13886 Denton TX 76203-3886 USA
This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes are configured as a one-dimensional array. We conduct experiments for implement... 详细信息
来源: 评论
Efficient parallel Algorithms for Pattern Recognition
收藏 引用
parallel Algorithms and Applications 1994年 第1-2期2卷 81-98页
作者: Das, Sajal K Fisher, Paul S Zhang, Hua Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX 76203-6886 United States
Finitely inductive (F1) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pat... 详细信息
来源: 评论
On the Complexity of Learning with a Small Number of Nodes
On the Complexity of Learning with a Small Number of Nodes
收藏 引用
1992 International Joint Conference on Neural Networks, IJCNN 1992
作者: Parberry, Ian Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas United States
It is shown that the loading pioblem foi a 6 node neural netwoik with node function set AC^ (that is, the conjunction or disjunction of a subset of the inputs or their complements) is AiV complete. It can be deduced f...
来源: 评论
Efficient parallel algorithms on interval graphs  4th
Efficient parallel algorithms on interval graphs
收藏 引用
4th International parallel Architectures and Languages Europe Conference, PARLE 1992
作者: Das, Sajal K. Chen, Calvin C. -Y. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203 United States
We design efficient parallel algorithms for solving several problems on interval graphs. The problems include finding a BFS-tree and DFS-tree, articulation points and bridges, and minimum coloring. Each of our algorit... 详细信息
来源: 评论
Managing a parallel heap efficiently  3rd
Managing a parallel heap efficiently
收藏 引用
3rd International Conference on parallel Architectures and Languages Europe, PARLE 1991
作者: Das, Sajal K. Horng, Wen-Bing Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203-3886 United States
We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. This is an improvement in space and time over the one recen... 详细信息
来源: 评论
Cost-optimal parallel algorithms for finitely inductive sequences  26
Cost-optimal parallel algorithms for finitely inductive sequ...
收藏 引用
26th Hawaii International Conference on System sciences, HICSS 1993
作者: Das, S.K. Fisher, P.S. Zhang, H. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203-3886 United States
Finitely inductive (FI) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pat... 详细信息
来源: 评论
An efficient algorithm for managing a parallel heap
收藏 引用
parallel Algorithms and Applications 1994年 第3-4期4卷 281-299页
作者: Das, Sajal K. Horng, Wen-Bing Moon, Gyo S. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX 76203-6886 United States Dept. of Computer Science and Information Engineering Tamkang Univ Tamsui Taipei Taiwan
We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read exclusive-write (EREW), parallel random access machine (PRAM) model. We also analyze the time and space complexities of our algorith... 详细信息
来源: 评论
Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems  5
Performance of parallel spanning tree algorithms on linear a...
收藏 引用
5th International parallel Processing Symposium, IPPS 1991
作者: Das, Sajal K. Yang, Cui-Qing Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas DentonTX76203-3886 United States
This paper presents empirical performance of parallel algorithms for computing a spanning tree (SPT) and a minimum spanning tree (MST) of connected graphs on the Transputer and Unix systems, where processors are confi... 详细信息
来源: 评论
A cost-optimal parallel algorithm for the parentheses matching problem on an EREW PRAM  5
A cost-optimal parallel algorithm for the parentheses matchi...
收藏 引用
5th International parallel Processing Symposium, IPPS 1991
作者: Chen, Calvin C.-Y. Das, Sajal K. Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas DentonTX76203-3886 United States
We present a cost-optimal parallel algorithm for the parentheses matching problem on the EREW PRAM model For n parentheses, the algorithm requires O(n/p + log n) time and O(n + p log p) space, employing p processors. ... 详细信息
来源: 评论