检索结果-内蒙古大学图书馆

20th International Conference on parallel and Distributed Computing Systems, PDCS 2007

作者： Rajasekaran, Sanguthevar Department of Computer Science and Engineering University of Connecticut StorrsCT06269-2155 United States

ISBN: (纸本)9781604233926

Motif search is the problem of identifying biologically significant parts from large datasets. Several versions of motif search have been proposed in the literature. Numerous algorithms are also available. Since the general problem of finding patterns in sequences is intractable, motif search instances that can be solved in practice are severely constrained. In this paper we propose parallel algorithms for these problems so as to relax the constraints. © 20th International Conference on parallel and Distributed Computing Systems, PDCS 2007. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for all minimum link paths and link center problems 3rd

Parallel algorithms for all minimum link paths and link cent...

引用

3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992

作者： Ghosh, Subir Kumar Maheshwari, Anil Computer Science Group Tata Institute of Fundamental Research Homi Bhabha Road Bombay400 005 India Computer Systems and Communication Group Tata Institute of Fundamental Research Homi Bhabha Road Bombay400 005 India

ISBN: (纸本)9783540557067

The link metric, defined on a constrained region R of the plane, sets the distance between a pair of points in R equal the minimum number of segments or links that are needed to construct a path in R between the points. The minimum link path problem is to compute a path consisting of minimum number of links between two points in R, when R is the inside of a simple polygon P of size ns. Recently Chandru et al. [1] proposed a parallel algorithm for computing minimum link path between two points inside P and it runs in O(log n log log n) time using O(n) processors. Here we show that minimum link paths from a point to all vertices of P can be computed in O(log2n log log n) time using O(n) processors. Using this result we propose a parallel algorithm for computing the link center of P. The link center of P is the set of points x inside P such that the link distance from x to any other point in P is minimized. The algorithm runs in O(log2n log log n) time using O(n2) processors. We also show that a triangle in the approximate link center can be computed in O(log3n log log n) time using O(n)processors. The complexity results of this paper are with respect to the CREW-PRAM model of computation. © Springer-Verlag Berlin Heidelberg 1992.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for term matching 8th

引用

8th International Conference on Automated Deduction, 1986

作者： Dwork, Cynthia Kanellakis, Paris Stockmeyer, Larry IBM Research Lab San Jose United States MIT Lab for Computer Science United States Brown University United States

ISBN: (纸本)9783540167808

We present a new randomized parallel algorithm for term matching. Let n be the number of nodes of the directed acyclic graphs (dags) representing the terms to be matched, then our algorithm uses O(log2n) parallel time and M(n) processors, where M(n) is the complexity of n by n matrix multiplication. The number of processors is a significant improvement over previously known bounds. Under various syntactic restrictions on the form of the input dags only O(n2) processors are required in order to achieve deterministic O(log2n) parallel time. Furthermore, we reduce directed graph reachability to term matching using constant parallel time and O(n2) processors. This is strong evidence that in practice, taking M(n) to be n3, no deterministic algorithm can beat the processor bound of our randomized algorithm. We also improve the lower bound of [DKM] on the unification problem. We show that unification is logspace- complete in PTIME even if both input terms are linear, i.e., no variable appears more than once in each term. © Springer-Verlag Berlin Heidelberg 1986.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT parallel algorithms FOR R-DOMINATING SET AND PARA-CENTER PROBLEMS ON TREES

引用

ALGORITHMICA 1990年第1期5卷 129-145页

作者： XIN, H YESHA, Y OHIO STATE UNIV DEPT COMP & INFORMAT SCI COLUMBUS OH 43210 USA

We develop efficient parallel algorithms for ther-dominating set and thep-center problems on trees. On a concurrent-read exclusive-write PRAM, our algorithm for ther-dominating set problem runs inO(logn log logn) time... 详细信息

关键词： parallel algorithms Trees Optimization problems r-Dominating set p-Center

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for large scale constrained tensor decomposition 40

Parallel algorithms for large scale constrained tensor decom...

引用

40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015

作者： Liavas, Athanasios P. Sidiropoulos, Nicholas D. Department of ECE Technical University of Crete Greece Department of ECE University of Minnesota United States

ISBN: (纸本)9781467369978

Most tensor decomposition algorithms were developed for in-memory computation on a single machine. There are a few recent exceptions that were designed for parallel and distributed computation, but these cannot easily incorporate practically important constraints, such as nonnegativity. A new constrained tensor factorization framework is proposed in this paper, building upon the Alternating Direction method of Multipliers (ADMoM). It is shown that this simplifies computations, bypassing the need to solve constrained optimization problems in each iteration, yielding algorithms that are naturally amenable to parallel implementation. The methodology is exemplified using nonnegativity as a baseline constraint, but the proposed framework can incorporate many other types of constraints. Numerical experiments are encouraging, indicating that ADMoM-based nonnegative tensor factorization (NTF) has high potential as an alternative to state-of-the-art approaches. © 2015 IEEE.

关键词： CANDECOMP constrained optimization nonnegative factorization PARAFAC parallel algorithms Tensors

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for Equilevel Predicates 24

Parallel Algorithms for Equilevel Predicates

引用

25th International Conference on Distributed Computing and Networking, ICDCN 2024

作者： Garg, Vijay K Streit, Robert P The University of Texas at Austin AustinTX United States

ISBN: (纸本)9798400716737

We define a new class of predicates called equilevel predicates on a distributive lattice which eases the analysis of parallel algorithms. Many combinatorial problems such as the vertex cover problem, the bipartite matching problem, and the minimum spanning tree problem can be modeled as detecting an equilevel predicate. The problem of detecting an equilevel problem is NP-complete, but equilevel predicates with the helpful property can be detected in polynomial time in an online manner. An equilevel predicate has the helpful property with a polynomial time algorithm if the algorithm can return a nonempty set of indices such that advancing on any of them can be used to detect the predicate. Furthermore, the refined independently helpful property allows online parallel detection of such predicates in NC. When the independently helpful property holds, advancing on all the specified indices in parallel can be used to detect the predicate in polylogarithmic time. We also define a special class of equilevel predicates called solitary predicates. Unless NP= RP, this class of predicate also does not admit efficient algorithms. Earlier work has shown that solitary predicates with the efficient advancement can be detected in polynomial time. We introduce two properties called the antimonotone advancement and the efficient rejection which yield the detection of solitary predicates in NC. Finally, we identify the minimum spanning tree, the shortest path, and the conjunctive predicate detection as problems satisfying such properties, giving alternative certifications of their NC memberships as a result. © 2024 Owner/Author.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

DYNAMIC CONTROL AND PROTOTYPING OF parallel algorithms FOR INTERMEDIATE-LEVEL AND HIGH-LEVEL VISION

引用

COMPUTER 1992年第2期25卷 43-53页

作者： WALLACE, AM MICHAELSON, GJ MCANDREW, P WAUGH, KG AUSTIN, WJ HERIOT WATT UNIV INST COMP BASED LEARNINGEDINBURGH EH1 1HXMIDLOTHIANSCOTLAND

Developing parallel algorithms for intermediate and high levels of computer vision systems is addressed. Because the algorithms are complex and the nature and size of the input and output data sets vary for each application, the authors have directly developed parallel algorithms for dynamic control of both processing and communication complexity during execution. They have also examined the merits of functional prototyping and transforming programs into imperative execution code for final implementation. To evaluate and give direction to their work, they have implemented algorithms for plane detection and object recognition on a flexible transputer network

关键词： communication complexity computer vision computer vision systems dynamic control flexible transputer network functional prototyping imperative execution code object recognition output data sets parallel algorithms parallel algorithms parallel programming plane detection software prototyping

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for the solution of toeplitz systems of linear equations 5th

引用

5th International Conference on parallel Processing and Applied Mathematics, PPAM 2003

作者： Alonso, Pedro Badía, José M. Vidal, Antonio M. Departamento de Sistemas Informáticos y Computación Universidad Politécnica de Valencia Cno. Vera s/n Valencia46022 Spain Departamento de Ingeniería y Ciencia de los Computadores Universidad Jaume I Campus de Riu Sec Castellón de la Plana12071 Spain

ISBN: (纸本)3540219463

In this paper we present two parallel algorithms to solve non-symmetric Toeplitz systems of linear equations. The first algorithm performs a modified QR factorization of the matrix by using the generalized Schur algorithm. The second one is based on the transformation of the Toeplitz matrix into a Cauchy-like matrix in order to reduce the communication cost. Both sequential methods have small computational cost. This fact makes it difficult to implement efficient parallel algorithms. We have tested the efficiency and stability of the algorithms on a cluster of personal computers. The results show the speed-up reaches the number of processors in many cases and both algorithms offer an accurate solution of the linear system. Besides, we have used public domain computation and communication libraries in order to get portable codes. © Springer-Verlag Berlin Heidelberg 2004.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for solution of tridiagonal systems on multicomputers 89

Parallel algorithms for solution of tridiagonal systems on m...

引用

3rd International Conference on Supercomputing, ICS 1989

作者： Sun, Xian-He Sun, Hong Zhang Ni, Lionel M. Department of Computer Science Michigan State University East LansingMI48824-1027 United States Department of Mathematics Michigan State University East LansingMI48824-1027 United States

ISBN: (纸本)0897913094

Three parallel algorithms, namely the parallel partition LU (PPT) algorithm, the parallel partition hybrid (PPH) algorithm, and the parallel diagonal dominant (PDD) algorithm are proposed for solving tridiagonal linear systems on multicomput-ers. These algorithms are based on the divide-and-conquer parallel computation model. The PPT and PPH algorithms support both pivoting and non-pivoting. The PPT algorithm is good when the number of processors is small;otherwise, the PPH algorithm is better. When the system is diagonal dominant, the PDD algorithm is highly parallel and provides an approximate solution which equals to the exact solution within machine accuracy. Both computation and communication complexities of the three algorithms are presented. All three methods proposed in this paper outperform other known parallel algorithms and have been implemented on a 64-node Ncube multicomputer. The analytic results matches closely with the results measured from the Ncube machine. © 1989 ACM.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for information dissemination by packets 3

Parallel algorithms for information dissemination by packets

引用

Proceedings of the Third IEEE Symposium on parallel and Distributed Processing

作者： Bagchi, A. Schmeichel, E.F. Hakimi, S.L. Bell Communications Research Department of Mathematics and Computer Science San Jose State University United States Department of Electrical Engineering and Computer Science University of California Davis United States

ISBN: (纸本)0818623101

Each vertex of an undirected graph possesses a piece of information which must be sent to every other vertex. The method of communication is to send bounded size packets of messages from one vertex to another. We describe parallel algorithms to accomplish the desired tasks for five prominent architectures. The algorithms are optimal, or nearly so, in every case. © 1991 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：