Results 1  10
of
542,995
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
to assign computations to processors at runtime. Besides having low overheads and good load balancing, it is important for the scheduling algorithm to minimize the space usage of the parallel program. This paper presents a scheduling algorithm that is provably spaceefficient and timeefficient for nested
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 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
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 87 (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
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
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
Extreme Markup Languages 2006®
, 2006
"... Frozen streams: an experimental time and spaceefficient implementation for inmemory representation of XML documents using Java ..."
Abstract
 Add to MetaCart
Frozen streams: an experimental time and spaceefficient implementation for inmemory representation of XML documents using Java
SpaceEfficient Closure Representations
, 1994
"... Many modern compilers implement function calls (or returns) in two steps: first, a closure environment is properly installed to provide access for free variables in the target program fragment; second, the control is transferred to the target by a "jump with arguments (or results)." Closur ..."
Abstract

Cited by 65 (12 self)
 Add to MetaCart
Many modern compilers implement function calls (or returns) in two steps: first, a closure environment is properly installed to provide access for free variables in the target program fragment; second, the control is transferred to the target by a "jump with arguments (or results
Fast subsequence matching in timeseries databases
 PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1994
"... We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract

Cited by 533 (24 self)
 Add to MetaCart
such trails into subtrails, which are subsequently represented by their Minimum Bounding Rectangles (MBRs). We also examine queries of varying lengths, and we show how to handle each case efficiently. We implemented our method and carried out experiments on synthetic and real data (stock price movements). We
Localitysensitive hashing scheme based on pstable distributions
 In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry
, 2004
"... inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate ..."
Abstract

Cited by 521 (8 self)
 Add to MetaCart
inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate
Results 1  10
of
542,995