咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 11 篇 工学
    • 11 篇 计算机科学与技术...
    • 2 篇 电气工程
    • 2 篇 软件工程
    • 1 篇 控制科学与工程
  • 3 篇 理学
    • 3 篇 数学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 11 篇 pram algorithms
  • 2 篇 string algorithm...
  • 2 篇 parallel algorit...
  • 1 篇 connected compon...
  • 1 篇 partition refine...
  • 1 篇 convex graphs
  • 1 篇 bucket sorting
  • 1 篇 algorithms
  • 1 篇 parallel computa...
  • 1 篇 prufer code
  • 1 篇 design of algori...
  • 1 篇 integer sorting
  • 1 篇 regular expressi...
  • 1 篇 bipartite graphs
  • 1 篇 image contour tr...
  • 1 篇 pattern recognit...
  • 1 篇 bijective tree e...
  • 1 篇 independent set
  • 1 篇 vlsi routing
  • 1 篇 high school

机构

  • 1 篇 univ maryland de...
  • 1 篇 univ buffalo sta...
  • 1 篇 department of co...
  • 1 篇 chiang mai univ ...
  • 1 篇 fairfax cty publ...
  • 1 篇 princeton univ p...
  • 1 篇 carnegie mellon ...
  • 1 篇 kings coll londo...
  • 1 篇 curtin univ tech...
  • 1 篇 univ roma la sap...
  • 1 篇 univ rouen lab i...
  • 1 篇 univ maryland in...
  • 1 篇 univ denver dept...
  • 1 篇 univ jean monnet...
  • 1 篇 univ missouri sc...
  • 1 篇 univ warsaw inst...
  • 1 篇 chiang mai univ ...
  • 1 篇 tel aviv univ il...
  • 1 篇 chiang mai univ ...
  • 1 篇 univ maryland de...

作者

  • 1 篇 krishnamurthy s
  • 1 篇 ubeda s
  • 1 篇 przytycka tm
  • 1 篇 han yijie
  • 1 篇 reid jf
  • 1 篇 diks k
  • 1 篇 ferreira a
  • 1 篇 liu sixue cliff
  • 1 篇 czumaj a
  • 1 篇 berkman o
  • 1 篇 jaja j
  • 1 篇 tzur ron
  • 1 篇 juneam nopadon
  • 1 篇 ellison david j.
  • 1 篇 iliopoulos costa...
  • 1 篇 vishkin u
  • 1 篇 thurimella r
  • 1 篇 tarjan robert en...
  • 1 篇 ziadi d
  • 1 篇 caminiti saverio

语言

  • 11 篇 英文
检索条件"主题词=Pram algorithms"
11 条 记 录,以下是1-10 订阅
排序:
An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
收藏 引用
THEORETICAL COMPUTER SCIENCE 1999年 第1-2期215卷 69-87页
作者: Ziadi, D Champarnaud, JM Univ Rouen Lab Informat Rouen Fac Sci F-76821 Mt St Aignan France
The aim of this paper is to describe a CREW-pram optimal algorithm which converts a regular expression of size s into its Glushkov automaton in O(logs) time using O(s(2)/log s) processors. This algorithm makes use of ... 详细信息
来源: 评论
TOP-BOTTOM ROUTING AROUND A RECTANGLE IS AS EASY AS COMPUTING PREFIX MINIMA
收藏 引用
SIAM JOURNAL ON COMPUTING 1994年 第3期23卷 449-465页
作者: BERKMAN, O JAJA, J KRISHNAMURTHY, S THURIMELLA, R VISHKIN, U UNIV MARYLAND INST ADV COMP STUDIESCOLL PKMD 20742 TEL AVIV UNIV IL-69978 TEL AVIVISRAEL UNIV MARYLAND DEPT ELECT ENGNCOLL PKMD 20742 UNIV DENVER DEPT MATH & COMP SCIDENVERCO 80208
A new parallel algorithm for the prefix minima problem is presented for inputs drawn from the range of integers [1..s]. For an input of size n, it runs in O(log log log s) time and O(n) work (which is optimal). A fast... 详细信息
来源: 评论
ULTRA-FAST PARALLEL CONTOUR TRACING, WITH APPLICATION TO THINNING
收藏 引用
PATTERN RECOGNITION 1994年 第7期27卷 867-878页
作者: FERREIRA, A UBEDA, S EPFL INFORMAT THEOR LAB CH-1015 LAUSANNE SWITZERLAND UNIV JEAN MONNET TSI ST ETIENNE FRANCE
This paper proposes a parallel algorithm for contour tracking of binary pictures. Given an object contour composed by O(N) pixels, our algorithm computes in constant time the next layer of the contour of that object, ... 详细信息
来源: 评论
Unified parallel encoding and decoding algorithms for Dandelion-like codes
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2010年 第11期70卷 1119-1127页
作者: Caminiti, Saverio Petreschi, Rossella Univ Roma La Sapienza Dept Comp Sci I-00198 Rome Italy
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported... 详细信息
来源: 评论
Fast and Efficient Parallel Coarsest Refinement
收藏 引用
FUNDAMENTA INFORMATICAE 2017年 第2期150卷 211-220页
作者: Juneam, Nopadon Kantabutra, Sanpawat Chiang Mai Univ Fac Sci Dept Comp Sci Chiang Mai 50200 Thailand Chiang Mai Univ Fac Engn Dept Comp Engn Theory Computat Grp Chiang Mai 50200 Thailand Chiang Mai Univ Dept Comp Engn Theory Computat Grp Chiang Mai Thailand
The process of merging two arbitrary partitions of a given finite set U of n elements is known as coarsest refinement. In the COARSEST REFINEMENT PROBLEM we are given two arbitrary partitions X,Y of the set U such tha... 详细信息
来源: 评论
Parallel maximum independent set in convex bipartite graphs
收藏 引用
INFORMATION PROCESSING LETTERS 1996年 第6期59卷 289-294页
作者: Czumaj, A Diks, K Przytycka, TM UNIV PADERBORN DEPT MATH & COMP SCID-33095 PADERBORNGERMANY UNIV WARSAW INST INFORMATPL-02097 WARSAWPOLAND UNIV MARYLAND DEPT COMP SCICOLLEGE PKMD 20742
A bipartite graph G = (V, W, E) is called convex if the vertices in W can be ordered in such a way that the elements of W adjacent to any vertex nu is an element of V form an interval (i.e. a sequence consecutively nu... 详细信息
来源: 评论
Optimal parallel analysis and decomposition of partially occluded strings
收藏 引用
PARALLEL COMPUTING 2000年 第4期26卷 483-494页
作者: Iliopoulos, CS Reid, JF Kings Coll London Dept Comp Sci Algorithm Design Grp London WC2R 2LS England Curtin Univ Technol Sch Comp Bentley WA 6102 Australia Univ Padua Dipartimento Elettron & Informat I-35131 Padua Italy
This is a theoretical study of partially occluded one-dimensional images. Here, we consider ''valid" images composed from a given set of objects, where some objects appearing in the image may be partially... 详细信息
来源: 评论
Simple Concurrent Connected Components algorithms
收藏 引用
ACM TRANSACTIONS ON PARALLEL COMPUTING 2022年 第2期9卷 1–26页
作者: Liu, Sixue Cliff Tarjan, Robert Endre Carnegie Mellon Univ Pittsburgh PA 15213 USA Princeton Univ Princeton NJ 08540 USA
We study a class of simple algorithms for concurrently computing the connected components of an n-vertex, m-edge graph. Our algorithms are easy to implement in either the COMBINING CRCW pram or the MPC computing model... 详细信息
来源: 评论
More Efficient Parallel Integer Sorting
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2022年 第5期33卷 411-427页
作者: Han, Yijie He, Xin Univ Missouri Sch Comp & Engn Kansas City MO 64110 USA Univ Buffalo State Univ New York Dept Comp Sci & Engn 338 Davis Hall Buffalo NY 14260 USA
We present a more efficient CREW pram algorithm for integer sorting. This algorithm sorts n integers in {0, 1, 2, ... , n(1/2)} in O(log n)(3/2)/log log n) time and O(n(log n/ log log n)(1/2)) operations. It also sort... 详细信息
来源: 评论
Is Teaching Parallel Algorithmic Thinking to High School Students Possible? One Teacher's Experience  10
Is Teaching Parallel Algorithmic Thinking to High School Stu...
收藏 引用
41st ACM Technical Symposium on Computer Science Education
作者: Torbert, Shane Tzur, Ron Vishkin, Uzi Ellison, David J. Fairfax Cty Publ Sch Thomas Jefferson High Sch Sci & Technol Fairfax Cty VA USA
All students at our high school are required to take at least one course in Computer Science prior to their junior year. They are also required to complete a year-long senior project associated with a specific in-hous... 详细信息
来源: 评论