Results 1  10
of
1,835
DivideandConquer Algorithms on the Hypercube
 Theoretical Computer Science
, 1993
"... We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level of the recursi ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level
DivideandConquer Algorithms on the Hypercube
 Theoretical Computer Science
, 1993
"... We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level of the recu ..."
Abstract
 Add to MetaCart
We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level
Supporting DivideandConquer Algorithms for Image Processing
 JOURNAL OF PARALLEL AND DISTBIBUTED COMPUTING 4,95 115
, 1987
"... Divideandconquer is an important algorithm strategy, but it is not widely used in image processing. For higherlevel, symbolic operations it should often be the strategy of choice for parallel computers. It is natural for a machine with a regular interconnection scheme such as a mesh, mesh with br ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Divideandconquer is an important algorithm strategy, but it is not widely used in image processing. For higherlevel, symbolic operations it should often be the strategy of choice for parallel computers. It is natural for a machine with a regular interconnection scheme such as a mesh, mesh
A DivideandConquer Algorithm for
"... Abstract. The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes [7]. The contribution of our paper is Brandes++, an algorithm for ex ..."
Abstract
 Add to MetaCart
Abstract. The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes [7]. The contribution of our paper is Brandes++, an algorithm
Performance Evaluation of Parallel DivideandConquer Algorithms
, 1993
"... this paper we evaluate the performance of several parallel divideandconquer algorithms which are created in a uniform manner by a software system developed for automatically transforming a sequential divideandconquer algorithm into parallel code, instead of individually designing a parallel ..."
Abstract
 Add to MetaCart
this paper we evaluate the performance of several parallel divideandconquer algorithms which are created in a uniform manner by a software system developed for automatically transforming a sequential divideandconquer algorithm into parallel code, instead of individually designing a parallel
Automatic Parallelization of DivideandConquer Algorithms
"... . In this paper we present a system that automatically partitions sequential divideandconquer algorithms programmed in C into independent tasks, maps these to a MEIKO transputer system and executes them in parallel. The feasibility of our approach is illustrated by parallelizing several example ..."
Abstract
 Add to MetaCart
. In this paper we present a system that automatically partitions sequential divideandconquer algorithms programmed in C into independent tasks, maps these to a MEIKO transputer system and executes them in parallel. The feasibility of our approach is illustrated by parallelizing several example
DivideandConquer Algorithms on TwoDimensional Meshes
, 1997
"... The Reflecting and Growing mappings have been proposed to map parallel divideandconquer algorithms onto twodimensional meshes. The performance properties of these mappings have been analysed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh. I ..."
Abstract
 Add to MetaCart
The Reflecting and Growing mappings have been proposed to map parallel divideandconquer algorithms onto twodimensional meshes. The performance properties of these mappings have been analysed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh
Practical Parallel DivideandConquer Algorithms
, 1997
"... Nested data parallelism has been shown to be an important feature of parallel languages, allowing the concise expression of algorithms that operate on irregular data structures such as graphs and sparse matrices. However, previous nested dataparallel languages have relied on a vector PRAM impleme ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
implementation layer that cannot be efficiently mapped to MPPs with high interprocessor latency. This thesis shows that by restricting the problem set to that of dataparallel divideandconquer algorithms I can maintain the expressibility of full nested dataparallel languages while achieving good
A DivideandConquer Algorithm for Betweenness Centrality ∗
, 2015
"... Given a set of target nodes S in a graph G we define the betweenness centrality of a node v with respect to S as the fraction of shortest paths among nodes in S that contain v. For this setting we describe Brandes++, a divideandconquer algorithm that can efficiently compute the exact values of bet ..."
Abstract
 Add to MetaCart
Given a set of target nodes S in a graph G we define the betweenness centrality of a node v with respect to S as the fraction of shortest paths among nodes in S that contain v. For this setting we describe Brandes++, a divideandconquer algorithm that can efficiently compute the exact values
The Automatic Complexity Analysis of DivideAndConquer Algorithms
, 1989
"... : Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. DivideandConquer Algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction. This p ..."
Abstract
 Add to MetaCart
: Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. DivideandConquer Algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction
Results 1  10
of
1,835