Results 1  10
of
2,704,976
SpaceEfficient Implementation of Nested Parallelism
 In Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
, 1996
"... Many of today's high level parallel languages support dynamic, finegrained parallelism. These languages allow the user to expose all the parallelism in the program, which is typically of a much higher degree than the number of processors. Hence an efficient scheduling algorithm is required to ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
parallel languages. In addition to proving the space and time bounds of the parallel schedule generated by the algorithm, we demonstrate that it is efficient in practice. We have implemented a runtime system that uses our algorithm to schedule parallel threads. The results of executing parallel programs
Computation and SpaceEfficient Implementation of SSA
, 2010
"... The computational complexity of different steps of the basic SSA is discussed. It is shown that the use of the generalpurpose “blackbox” routines (e.g. found in packages like LAPACK) leads to huge waste of time resources since the special Hankel structure of the trajectory matrix is not taken into ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
efficiently by the means of Fast Fourier Transform. The use of these methods yields the reduction of the worstcase computational complexity from O(N3) to O(kN logN), where N is series length and k is the number of eigentriples desired. 1
A provable time and space efficient implementation of nesl
 In International Conference on Functional Programming
, 1996
"... In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed Jcalculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable implementa ..."
Abstract

Cited by 84 (10 self)
 Add to MetaCart
In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed Jcalculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable
A SpaceEfficient Implementation of the GoodSuffix Heuristic
"... Abstract. We present an efficient variation of the goodsuffix heuristic, firstly introduced in the wellknown BoyerMoore algorithm for the exact string matching problem. Our proposed variant uses only constant space, retaining much the same time efficiency of the original rule, as shown by extens ..."
Abstract
 Add to MetaCart
Abstract. We present an efficient variation of the goodsuffix heuristic, firstly introduced in the wellknown BoyerMoore algorithm for the exact string matching problem. Our proposed variant uses only constant space, retaining much the same time efficiency of the original rule, as shown
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 541 (1 self)
 Add to MetaCart
to materialize. The greedy algorithm performs within a small constant factor of optimal under a variety of models. We then consider the most common case of the hypercube lattice and examine the choice of materialized views for hypercubes in detail, giving some good tradeoffs between the space used
Neural Networks Using Bit Stream Arithmetic: a Space Efficient Implementation
 IN PROCEEDINGS OF THE IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS
, 1994
"... In this paper an expandable digital architecture that provides an efficient implementation base for large neural networks, is presented. The architecture uses the circuit for arithmetic operations on delta encoded signals to carry out the large number of required parallel synaptic calculations. Al ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper an expandable digital architecture that provides an efficient implementation base for large neural networks, is presented. The architecture uses the circuit for arithmetic operations on delta encoded signals to carry out the large number of required parallel synaptic calculations
Time and Space Efficient Implementation of Robust Biclustering Algorithm (ROBA)
"... Biclustering techniques perform clustering simultaneously along rows and columns of a matrix in order to find which rows are clustered under which columns and/or vice versa. A bicluster of a gene expression matrix is a subset of rows (genes) that exhibits similar behavior under a subset of ..."
Abstract
 Add to MetaCart
Biclustering techniques perform clustering simultaneously along rows and columns of a matrix in order to find which rows are clustered under which columns and/or vice versa. A bicluster of a gene expression matrix is a subset of rows (genes) that exhibits similar behavior under a subset of
Efficient implementation of a BDD package
 In Proceedings of the 27th ACM/IEEE conference on Design autamation
, 1991
"... Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract

Cited by 499 (9 self)
 Add to MetaCart
to decrease memory use. Memory function efficiency is improved by using rules that detect. when equivalent functions are computed. The usefulness of the package is enhanced by an automatic and lowcost scheme for rec:ycling memory. Experimental results are given to demonstrate why various implementation trade
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 699 (5 self)
 Add to MetaCart
sampling of the space of normals. We conclude by proposing a combination of ICP variants optimized for high speed. We demonstrate an implementation that is able to align two range images in a few tens of milliseconds, assuming a good initial guess. This capability has potential application to realtime 3D
Efficient SoftwareBased Fault Isolation
, 1993
"... One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightlycoupled modules, this solution incurs prohibitive context switch overhead, In this paper, we present a software approach to implementing fault isolation within a sing ..."
Abstract

Cited by 773 (12 self)
 Add to MetaCart
One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightlycoupled modules, this solution incurs prohibitive context switch overhead, In this paper, we present a software approach to implementing fault isolation within a
Results 1  10
of
2,704,976