Results 11  20
of
8,537
Recursive Algorithm for Generating Partitions of an Integer
"... Abstract. This article first reviews the problem of partitioning a positive integer in general. And then recursive algorithms for P(n,k), generating exactly k partitions of a positive number n are presented. The most efficient recursive algorithm’s computational running time is Θ(k×p(n,k)) which is ..."
Abstract
 Add to MetaCart
Abstract. This article first reviews the problem of partitioning a positive integer in general. And then recursive algorithms for P(n,k), generating exactly k partitions of a positive number n are presented. The most efficient recursive algorithm’s computational running time is Θ(k×p(n,k)) which
Scheduling of dataindependent recursive algorithms
 Proc. European Conf. Circuit Theory Design
"... Abstract A new scheduling formulation for data independent recursive algorithms is proposed. This formulation is intuitive and finds a static rate optimal schedules. Processing elements may be nonpreemptive and nonhomogenous. Comparisons with some other common scheduling methods to increase throu ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract A new scheduling formulation for data independent recursive algorithms is proposed. This formulation is intuitive and finds a static rate optimal schedules. Processing elements may be nonpreemptive and nonhomogenous. Comparisons with some other common scheduling methods to increase
Analysis of Recursive Algorithms By the Contraction Method
"... Several examples of the asymptotic analysis of recursive algorithms are investigated by the contraction method. The examples concern random permutations and binary search trees. In these examples it is demonstrated that the contraction method can be applied successfully to problems with contraction ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Several examples of the asymptotic analysis of recursive algorithms are investigated by the contraction method. The examples concern random permutations and binary search trees. In these examples it is demonstrated that the contraction method can be applied successfully to problems with contraction
RECURSIVE ALGORITHMS FOR DISTRIBUTED FORESTS OF OCTREES
"... Abstract. The forestofoctrees approach to parallel adaptive mesh refinement and coarsening (AMR) has recently been demonstrated in the context of a number of largescale PDEbased applications. Efficient reference software has been made freely available to the public both in the form of the stand ..."
Abstract
 Add to MetaCart
branches to design efficient recursive algorithms that operate on distributed forests of octrees. We present three important algorithms with recursive implementations. The first is a parallel search for leaves matching any of a set of multiple search criteria, such as leaves that contain points
Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition
 in Conference Record of The TwentySeventh Asilomar Conference on Signals, Systems and Computers
, 1993
"... In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang (199 ..."
Abstract

Cited by 637 (1 self)
 Add to MetaCart
In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang
Implementing Progress Indicators For Recursive Algorithms
"... A percentdone progress indicator is a software tool that allows a user to monitor the progress that a software system has made toward responding to a command. Formal experiments have demonstrated that users prefer software systems that incorporate percentdone progress indicators over those that do ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that are driven by recursive algorithms that are not required to follow the "linear pass over data" p...
Mixed Time Scale Recursive Algorithms
"... In this paper we investigate the behavior of certain types of mixed time scale adaptive algorithms. These systems comprise a "fast" or quickly changing algorithm mutually coupled to a "slow" or slowly changing algorithm. They arise naturally in a variety of adaptive environmen ..."
Abstract
 Add to MetaCart
separately. 2 1 Introduction Many recursive algorithms have the general form W k+1 = W k + \Theta "gradient" \Theta "error" (1) where...
V.: Parallel Recursive Algorithm for FCA
 Palacky University, Olomouc
, 2008
"... Abstract. This paper presents a parallel algorithm for computing formal concepts. Presented is a sequential version upon which we build the parallel one. We describe the algorithm, its implementation, scalability, and provide an initial experimental evaluation of its efficiency. The algorithm is fas ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Abstract. This paper presents a parallel algorithm for computing formal concepts. Presented is a sequential version upon which we build the parallel one. We describe the algorithm, its implementation, scalability, and provide an initial experimental evaluation of its efficiency. The algorithm
Efficient Recursive Algorithm for the Inverse Discrete Cosine Transform
 IEEE Signal Processing Letters
, 2000
"... Abstract—Recursive algorithms have been found very effective for realization using software and very large scale integrated circuit (VLSI) techniques. Recently, some recursive algorithms have been proposed for the realization of the inverse discrete cosine transform (IDCT). In this paper, an effici ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—Recursive algorithms have been found very effective for realization using software and very large scale integrated circuit (VLSI) techniques. Recently, some recursive algorithms have been proposed for the realization of the inverse discrete cosine transform (IDCT). In this paper
A recursive algorithm for Markov random fields
 Biometrika
, 2002
"... The NRCSE was established in 1997 through a cooperative agreement with the United States Environmental Protection Agency which provides the Center's primary funding. A recursive algorithm for Markov random fields ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
The NRCSE was established in 1997 through a cooperative agreement with the United States Environmental Protection Agency which provides the Center's primary funding. A recursive algorithm for Markov random fields
Results 11  20
of
8,537