نتایج جستجو برای: linear speedup
تعداد نتایج: 490347 فیلتر نتایج به سال:
We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in these systems compared to lengths in Frege proof systems. As an application we give a near-linear simulation of the proposition...
A two-class Support Vector Machine (SVM) classifier finds a hyperplane that separates two classes of data with the maximum margin. In a first learning phase, SVM involves the construction and solution of a primal-dual interiorpoint optimization problem. Each iteration of the interior-point method (IPM) requires a sparse linear system solution, which dominates the execution time of SVM learning....
Global scheduling in a treegion framework has been proposed to exploit instruction level parallelism (ILP) at compile time. A treegion is a single-entry / multiple-exit global scheduling scope that consists of basic blocks with control-flow that forms a tree. Because a treegion scope is nonlinear (includes multiple paths) it is distinguished from linear scopes such as traces or superblocks. Tre...
The weighted maximum satis ability MAX SAT problem is central in mathematical logic computing theory and many indus trial applications In this paper we present a parallel greedy randomized adaptive search procedure GRASP for solving MAX SAT problems Experimental results indicate that almost linear speedup is achieved
In this paper we consider Monte Carlo (MC) algorithms based on the use of the resolvent matrix for solving linear algebraic problems. Estimates for the speedup and efficiency of the algorithms are presented. Some numerical examples performed on cluster of workstations using MPI are given.
We describe finite-state constraint relaxation, a method for applying global constraints, expressed as automata, to sequence model decoding. We present algorithms for both hard constraints and binary soft constraints. On the CoNLL-2004 semantic role labeling task, we report a speedup of at least 16x over a previous method that used integer linear programming.
We describe herein the parallel implementation of the Bi-CGSTAB method with a block Red-Black Gauss-Seidel (RBGS) preconditioner applied to the systems of linear algebraic equations that arise from the Hermite collocation discretization of partial di erential equations in two spatial dimensions. The method is implemented on the Cray T3E, a parallel processing supercomputer. Speedup results are ...
We describe an efficient FPGA implementation for the exponentiation of large matrices. The research is related to an algorithm for constructing uniformly distributed linear recurring sequences. The design utilizes the special properties of both the FPGA and the used matrices to achieve a very significant speedup compared to traditional architectures.
The paper presents a method to integrate parallelism in the DIPLIB sequential image processing library. The library contains several framework functions for di erent types of operations. We parallelize the lter framework function (contains the neighborhood image processing operators). We validate our method by testing it with the geometric mean lter. Experiments on a cluster of workstations sho...
Our randomized preprocessing of a matrix by means of augmentation counters its degeneracy and ill conditioning, uses neither pivoting nor orthogonalization, readily preserves matrix structure and sparseness, and leads to dramatic speedup of the solution of general and structured linear systems of equations in terms of both estimated arithmetic time and observed CPU time.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید