Results 1  10
of
243
Efficient Mapping and Functional Verification of Parallel Al gorithms on a MultiContext Reconfigurable Architecture
"... Parallel multicontext reconfigurable architectures provide very attractive platforms with respect to computational performance and reconfigurable features. Today’s challenge is the exploitation of this reconfigurable and computational potential to ascertain efficient solution for mapping applicati ..."
Abstract
 Add to MetaCart
of the realization. Using this continuous design flow we derive an efficient realization of the edge detection algorithm (EDA) on a parallel multicontext reconfigurable architecture. We describe in detail how the parallel realization of the EDA has to be translated in a specification for programming the CRC model
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
causes convergence versus oscill ation? What our initial experiments show is that loopy prop agation does a good job of approximating the correct posteriors if it converges. Unfortunately, on the most challenging casethe QMRDT networkthe al gorithm did not converge. We wanted to see
Implementation and Evaluation of a ParallelExternal Algorithm for Cycle Structure Computation on a PCCluster
"... Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a subproblem, the cycle structure of a modified permutation given as a table that is partitioned over N hard disks has to be computed. Whil ..."
Abstract
 Add to MetaCart
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a subproblem, the cycle structure of a modified permutation given as a table that is partitioned over N hard disks has to be computed
Information and Knowledge Engineering,
"... The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional faultfr ..."
Abstract
 Add to MetaCart
The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault
Performance Analysis of Asynchronous Parallel
, 2013
"... The directed acyclic graph (DAG) associated with a parallel algorithm captures the order in which separate local computations are completed and how their outputs are subsequently used in further computations. Unlike in a synchronous parallel algorithm the DAG associated with an asynchronous paral ..."
Abstract
 Add to MetaCart
The directed acyclic graph (DAG) associated with a parallel algorithm captures the order in which separate local computations are completed and how their outputs are subsequently used in further computations. Unlike in a synchronous parallel algorithm the DAG associated with an asynchronous
On The Parallelization Of Integer Polynomial Multiplication
, 2014
"... With the advent of hardware accelerator technologies, multicore processors and GPUs, much effort for taking advantage of those architectures by designing parallel algorithms has been made. To achieve this goal, one needs to consider both algebraic complexity and parallelism, plus making efficient ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
With the advent of hardware accelerator technologies, multicore processors and GPUs, much effort for taking advantage of those architectures by designing parallel algorithms has been made. To achieve this goal, one needs to consider both algebraic complexity and parallelism, plus making efficient
Computation of the Hausdorff distance between sets of line segments in parallel
, 2012
"... We show that the Hausdorff distance for two sets of nonintersecting line segments can be computed in parallel in O(log2 n) time using O(n) processors in a CREWPRAM computation model. We discuss how some parts of the sequential algorithm can be performed in parallel using previously known parallel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
coordinate. Each segment set is assumed to be intersection free. For this intersection problem we describe a parallel algorithm which completes the Hausdorff distance computation within the stated time and processor bounds.
A Simple and Practical LinearWork Parallel Algorithm for Connectivity
"... Graph connectivity is a fundamental problem in computer science with many important applications. Sequentially, connectivity can be done in linear work easily using breadthfirst search or depthfirst search. There have been many parallel algorithms for connectivity, however the simpler parallel al ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
algorithms require superlinear work, and the linearwork polylogarithmicdepth parallel algorithms are very complicated and not amenable to implementation. In this work, we address this gap by describing a simple and practical expected linearwork, polylogarithmic depth parallel algorithm for graph
A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint
, 1997
"... A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is f ..."
Abstract
 Add to MetaCart
and parallel algorithms with double precision. Also, based on 40 randomly generated problems of the same size, with 16 variables and 32 linear constraints (plus x ≥ 0), the numerical results from different number processors are reported, including the serial algo
A parallel algorithm for computing cooperative responses through a Web API Patent Pending
"... Hundreds of new search engines have recently appeared on the Web. Many of them consist of a search frontend that accesses one or more search backends through a Web API. Typical API latencies range from one tenth of a second to one or two seconds. Such latencies are acceptable for running a single ..."
Abstract
 Add to MetaCart
herent parallelism of a Web API. We describe a parallel algorithm that computes cooperative responses and prove its soundness, completeness and nonredundancy. We provide performance results obtained from an implementation of the algorithm in Noflail Search, a search frontend available at noflail.com.
Results 1  10
of
243