咨询与建议

限定检索结果

文献类型

  • 34 篇 会议
  • 11 篇 期刊文献
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 24 篇 工学
    • 23 篇 计算机科学与技术...
    • 14 篇 软件工程
    • 5 篇 控制科学与工程
    • 4 篇 电气工程
    • 3 篇 信息与通信工程
    • 2 篇 力学(可授工学、理...
    • 2 篇 材料科学与工程(可...
    • 1 篇 机械工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 交通运输工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 农业工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 食品科学与工程(可...
  • 8 篇 理学
    • 7 篇 数学
    • 1 篇 化学
    • 1 篇 生物学
  • 8 篇 管理学
    • 5 篇 图书情报与档案管...
    • 4 篇 管理科学与工程(可...
    • 2 篇 工商管理
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 农学
    • 1 篇 作物学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 临床医学
    • 1 篇 药学(可授医学、理...

主题

  • 9 篇 parallel algorit...
  • 9 篇 distributed comp...
  • 8 篇 concurrent compu...
  • 4 篇 computational mo...
  • 4 篇 partitioning alg...
  • 3 篇 phase change ran...
  • 3 篇 pattern recognit...
  • 3 篇 load management
  • 3 篇 data structures
  • 3 篇 computer network...
  • 2 篇 computer simulat...
  • 2 篇 computer science
  • 2 篇 electronic mail
  • 2 篇 neural networks
  • 2 篇 knowledge graph
  • 2 篇 very large scale...
  • 2 篇 transputers
  • 2 篇 binary trees
  • 2 篇 contracts
  • 2 篇 algorithm design...

机构

  • 5 篇 guangxi intellig...
  • 4 篇 center for resea...
  • 3 篇 school of comput...
  • 3 篇 school of comput...
  • 2 篇 university of ai...
  • 2 篇 information rese...
  • 2 篇 center for resea...
  • 2 篇 center for resea...
  • 2 篇 center for resea...
  • 2 篇 center for paral...
  • 2 篇 science and tech...
  • 2 篇 shanghai key lab...
  • 2 篇 sierra vista res...
  • 2 篇 shandong univers...
  • 2 篇 china tobacco gu...
  • 2 篇 center for resea...
  • 2 篇 college of compu...
  • 2 篇 research center ...
  • 2 篇 national key lab...
  • 2 篇 defense innovati...

作者

  • 7 篇 s.k. das
  • 6 篇 das sajal k.
  • 3 篇 ningjiang chen
  • 3 篇 chen ningjiang
  • 3 篇 p. banerjee
  • 3 篇 hu minghao
  • 3 篇 huang zhen
  • 2 篇 c.c.-y. chen
  • 2 篇 yingxiong nong
  • 2 篇 liming fang
  • 2 篇 sajal k. das
  • 2 篇 li dongsheng
  • 2 篇 yang dong
  • 2 篇 chen calvin c.-y...
  • 2 篇 zhe liu
  • 2 篇 jiachen shen
  • 2 篇 chunhua su
  • 2 篇 horng wen-bing
  • 2 篇 zhe li
  • 2 篇 jun zhou

语言

  • 44 篇 英文
  • 2 篇 其他
检索条件"机构=Center for Research in Parallel and Distributed Computing"
46 条 记 录,以下是1-10 订阅
排序:
Partial Order-centered Hyperbolic Representation Learning for Few-shot Relation Extraction  31
Partial Order-centered Hyperbolic Representation Learning fo...
收藏 引用
31st International Conference on Computational Linguistics, COLING 2025
作者: Hu, Biao Huang, Zhen Hu, Minghao Yang, Pinglv Qiao, Peng Dou, Yong Wang, Zhilin National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology China Center of Information Research Academy of Military Science China College of Meteorology and Oceanology National University of Defense Technology China
Prototype network-based methods have made substantial progress in few-shot relation extraction (FSRE) by enhancing relation prototypes with relation descriptions. However, the distribution of relations and instances i... 详细信息
来源: 评论
PEbfs: Implement High-Performance Breadth-First Search on PEZY-SC3s  24th
PEbfs: Implement High-Performance Breadth-First Search on P...
收藏 引用
24th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2024
作者: Guo, Weihao Wang, Qinglin Liu, Xiaodong Peng, Muchun Yang, Shun Liang, Yaling Shi, Yongzhen Cao, Ligang Liu, Jie Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology Changsha410073 China Engineering Research Center for National Fundamental Software National University of Defense Technology Changsha410073 China
The breadth-first search (BFS) algorithm is a fundamental algorithm in graph theory, and it’s parallelization can significantly improve performance. Therefore, there have been numerous efforts to leverage the powerfu... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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 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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论