Results 11  20
of
1,316
DivideandConquer Mapping of Parallel Programs onto Hypercube Computers
 J. of Systems Architecture
, 1993
"... Mapping of parallel programs onto parallel computers for efficient execution is a fundamental problem of great significance in parallel processing. This paper describes a heuristic algorithm for mapping arbitrary parallel programs onto hypercube computers using a divideandconquer technique. The ru ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Mapping of parallel programs onto parallel computers for efficient execution is a fundamental problem of great significance in parallel processing. This paper describes a heuristic algorithm for mapping arbitrary parallel programs onto hypercube computers using a divideandconquer technique
DivideandConquer Approach for Designing Largeoperand Functions on Reconfigurable Computers
"... Reconfigurable computers (RCs) are gaining rising attention as an alternative to traditional processors for many applications. However, using RCs for operations with either largesize operands or large number of operands can be challenging given the bounded reconfigurable resources. In this paper, w ..."
Abstract
 Add to MetaCart
, we propose a systematic methodology based on a DivideandConquer technique for the implementation of such operations on RCs. A generic architecture is presented where schedulers are necessary to virtualize the usage of the limited resources. Two case studies, namely largesizeoperand multiplication
Covering vs DivideandConquer for TopDown Induction of Logic Programs
"... Covering and divideandconquer are two wellestablished search techniques for topdown induction of propositional theories However, for topdown induction of logic programs, only covering has been formalized and used extensively In this work, the divideandconquer technique is formalized as well an ..."
Abstract
 Add to MetaCart
Covering and divideandconquer are two wellestablished search techniques for topdown induction of propositional theories However, for topdown induction of logic programs, only covering has been formalized and used extensively In this work, the divideandconquer technique is formalized as well
08939659/97 $7.00+0.00 Improving the DivideandConquer Approach to SumofPairs Multiple Sequence Alignment
, 1996
"... Abstract—We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding “sum of pairs ” distance score. We generalize the divideandconquer technique described in [1,2], and present new ..."
Abstract
 Add to MetaCart
Abstract—We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding “sum of pairs ” distance score. We generalize the divideandconquer technique described in [1,2], and present
First Principles Calculations using Density Matrix DivideandConquer within the SIESTA Methodology
"... Abstract. The density matrix divideandconquer technique for the solution of KohnSham density functional theory has been implemented within the framework of the SIESTA methodology. Implementation details are provided where the focus is on the scaling of the computation time and memory use, in both ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The density matrix divideandconquer technique for the solution of KohnSham density functional theory has been implemented within the framework of the SIESTA methodology. Implementation details are provided where the focus is on the scaling of the computation time and memory use
ENHANCED DIVIDEANDCONQUER ALGORITHM WITH 2BLOCK POLICY Mustafa Mat Deris,
"... The number of comparisons involved in searching minimum and maximum elements from a set of data will determine the performance of an algorithm. A DivideandConquer algorithm is the most efficient algorithm for searching minimum and maximum elements of a set of data of any size. However, the perform ..."
Abstract
 Add to MetaCart
, the performance of this algorithm can still be improved by reducing the number of comparisons of certain sets of data. In this paper a 2block (2B) policy under the divideandconquer technique is proposed in order to deal with this problem. On the basis of this policy, the divideandconquer algorithm
Linearscaling quantum mechanical calculations of biological molecules: The divideandconquer approach
, 1998
"... The divideandconquer technique for linearscaling quantum mechanical calculations is reviewed. The method divides a large system into many subsystems, determines the density matrix of each subsystem separately, and sums the corresponding subsystem contributions to obtain the total density matrix ..."
Abstract
 Add to MetaCart
The divideandconquer technique for linearscaling quantum mechanical calculations is reviewed. The method divides a large system into many subsystems, determines the density matrix of each subsystem separately, and sums the corresponding subsystem contributions to obtain the total density matrix
Dense Disparity Estimation with a DivideandConquer Disparity Space Image Technique
"... Abstract — A new divideandconquer technique for disparity estimation is proposed in this paper. This technique performs feature matching following the high confidence first principle, starting with the strongest feature point in the stereo pair of scanlines. Once the first matching pair is establi ..."
Abstract
 Add to MetaCart
Abstract — A new divideandconquer technique for disparity estimation is proposed in this paper. This technique performs feature matching following the high confidence first principle, starting with the strongest feature point in the stereo pair of scanlines. Once the first matching pair
Improving the DivideandConquer Approach to SumofPairs Multiple Sequence Alignment
 Appl. Math. Lett
, 1997
"... We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divideandconquer technique described in [1,2], and present ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divideandconquer technique described in [1,2], and present
DivideandConquer Matrix Factorization
"... This work introduces DivideFactorCombine (DFC), a parallel divideandconquer framework for noisy matrix factorization. DFC divides a largescale matrix factorization task into smaller subproblems, solves each subproblem in parallel using an arbitrary base matrix factorization algorithm, and combin ..."
Abstract
 Add to MetaCart
This work introduces DivideFactorCombine (DFC), a parallel divideandconquer framework for noisy matrix factorization. DFC divides a largescale matrix factorization task into smaller subproblems, solves each subproblem in parallel using an arbitrary base matrix factorization algorithm
Results 11  20
of
1,316