Results 1  10
of
1,376,425
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Fast parallelized algorithm for ECG analysis
"... Abstract: A new approach based on the adoption of wavelet transforms is presented for the R point localization in ECG signals. The conceived real time signal processing technique, which uses a fast parallelized algorithm, has been evaluated adopting the standard MITBIH Arrhythmia database which in ..."
Abstract
 Add to MetaCart
Abstract: A new approach based on the adoption of wavelet transforms is presented for the R point localization in ECG signals. The conceived real time signal processing technique, which uses a fast parallelized algorithm, has been evaluated adopting the standard MITBIH Arrhythmia database which
Fast Parallel Algorithm for the Maximal Independent Set Problem
 Proc. 16th Annual ACM Symposium on Theory Of Computing
, 1984
"... Abstract. A parallel algorithm is presented that accepts as input a graph G and produces a maximal independent set of vertices in G. On a PRAM without the concurrent write or concurrent read features, the algorithm executes in G((10gn)~) time and uses 0((n/(logn))3) processors, where n is the numbe ..."
Abstract

Cited by 95 (1 self)
 Add to MetaCart
Abstract. A parallel algorithm is presented that accepts as input a graph G and produces a maximal independent set of vertices in G. On a PRAM without the concurrent write or concurrent read features, the algorithm executes in G((10gn)~) time and uses 0((n/(logn))3) processors, where n
Fast parallel algorithms for matrix reduction to normal forms
 IN ENGINEERING, COMMUNICATION AND CONTROL
, 1997
"... We investigate fast parallel algorithms to compute normal forms of matrices and the corresponding transformations. Given a matrix B in M (K), where K is an arbitrary commutative field, we establish that computing a similarity transformation P such that F"P��BP is in Frobenius normal form can be ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We investigate fast parallel algorithms to compute normal forms of matrices and the corresponding transformations. Given a matrix B in M (K), where K is an arbitrary commutative field, we establish that computing a similarity transformation P such that F"P��BP is in Frobenius normal form can
Fast Parallel Algorithms for the Clique Separator Decomposition
, 1990
"... We give an efficient NC algorithm for finding a clique separator decomposition of an arbitrary graph, that is, a series of cliques whose removal disconnects the graph. This algorithm allows one to extend a large body of results which were originally formulated for chordal graphs to other classes of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
of the decomposition. These optimization problems include: finding a maximumweight clique, a minimum coloring, a maximumweight independent set, and a minimum fillin elimination order. We also give the first parallel algorithms for solving these problems by using the clique separator decomposition. Our maximum
Fast parallel algorithm to the minimum edge cover
, 2013
"... problem based on DNA molecular computation ..."
Fast Parallel Algorithm for Finding the kth Longest Path in A Tree
, 1995
"... We present a fast parallel algorithm running in O(log 2 n) time on a CREW PRAM with O(n) processors for nding the kth longest path in a given tree of n vertices (with (n 2) intervertex distances). Our algorithm is obtained by e cient parallelization of a sequential algorithm which isavariant of both ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a fast parallel algorithm running in O(log 2 n) time on a CREW PRAM with O(n) processors for nding the kth longest path in a given tree of n vertices (with (n 2) intervertex distances). Our algorithm is obtained by e cient parallelization of a sequential algorithm which isavariant
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
 SIAM J. COMPUT
, 1990
"... The authors consider the problem of reconstructing (i.e., interpolating) a tsparse multivariate polynomial given a black box which will produce the value of the polynomial for any value of the arguments. It is shown that, if the polynomial has coefficients in a finite field GF[q] and the black box ..."
Abstract

Cited by 65 (15 self)
 Add to MetaCart
can evaluate the polynomial in the field GF[qr2g,tnt+37], where n is the number of variables, then there is an algorithm to interpolate the polynomial in O(log (nt)) boolean parallel time and O(n2t log nt) processors. This algorithm yields the first efficient deterministic polynomial time algorithm
Optimally Fast Parallel Algorithms for Preprocessing and Pattern Matching in One and Two Dimensions
, 1993
"... All algorithms below are optimal alphabetindependent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the stringmatching problem, we design an algorithm that computes a deterministic sample of a sufficiently long substring in constant time. This problem use ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
All algorithms below are optimal alphabetindependent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the stringmatching problem, we design an algorithm that computes a deterministic sample of a sufficiently long substring in constant time. This problem
A Fast Parallel Algorithm for the Poisson Equation on a Disk
 Jour. Comput. Phys
, 2001
"... this paper, we present efficient sequential and parallel algorithms for solving the Poisson equation on a disk using Green's function method ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
this paper, we present efficient sequential and parallel algorithms for solving the Poisson equation on a disk using Green's function method
Results 1  10
of
1,376,425