An important goal of visualization technology is to support the exploration and analysis of very large amounts of data. In this paper, we propose a new visualization technique called 'recursive pattern' which has been developed for visualizing large amounts of multidimensional data. The technique is based on a generic recursive scheme which generalizes a wide range of pixel-oriented arrangement...

In this paper a new recursive output-only identification algorithm is proposed based on stochastic realization, a classical covariance driven subspace identification technique. The recursive algorithm yields results that are in close agreement with those of its non-recursive counterpart. Furthermore, the relatively low complexity of the algorithm makes it an excellent kandidate for use during i...

This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results given here show that the recursive approach may perform comparable to leading software packages for...

Recursive models have been used in the past to model the variation of number of processes in all the queuing systems of heterogeneous parallel computer system. The main reasons for the use of recursive models when modeling the variation of number of processes in all the queuing systems of a heterogeneous parallel computer system is the inability of the analytic technique to determine the exact ...

Recently, recursive blocked algorithms for solving triangular one-sided and two-sided Sylvester-type equations were introduced by Jonsson and K̊agström. This elegant yet simple technique enables an automatic variable blocking that has the potential of matching the memory hierarchies of today’s HPC systems. The main parts of the computations are performed as level 3 general matrix multiply and ad...

Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelising loops. Recursive procedures, which are also frequently used in real-world applications, have attracted much less attention. Moreover, the parallel threads in prior work are statically predicted and spawned. In this...

-We develop a method of performing pattern recognition (discrimination and classification) using a recursive technique derived from mixture models, kernel estimation and stochastic approximation. Unsupervised learning Density estimation Kernel estimator Mixture model Stochastic approximation Recursive estimation

‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

in this paper, we propose to extend the hierarchical bivariatehermite interpolant to the spherical case. let $t$ be an arbitraryspherical triangle of the unit sphere $s$ and  let $u$ be a functiondefined over the triangle $t$. for $kin mathbb{n}$, we consider ahermite spherical interpolant problem $h_k$ defined by some datascheme $mathcal{d}_k(u)$ and which admits a unique solution $p_k$in the ...

We describe a technique that allows the exact analytical computation of the mean first passage time (MFPT) for infinite families of trees using their recursive properties. The method is based in the relationship between the MFPT and the eigenvalues of the Laplacian matrix of the trees but avoids their explicit computation. We apply this technique to find the MFPT for a family of generalized det...