نتایج جستجو برای: recursive computation
تعداد نتایج: 169778 فیلتر نتایج به سال:
Abstract Many important computation problems can be specified by block recursive algorithms. For example, matrix transposition and fast Fourier transform are block recursive algorithms. In this paper, we present a methodology of VLSI circuit design for block recursive algorithms based on the tensor product theory. Matrix transposition and fast Fourier transform algorithms are designed and imple...
Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness for providing a careful security analysis in the case of standard authentication and confidentiality protocols. However, most current techniques do not apply to protocols that perform recursive computation e.g. on a list of mes...
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce control flow overhead and increase the size of the basic blocks in the computation, which in turn increases the effectiveness of standard compiler optimizations such as register allocation and instruction scheduling. We...
We focus on the development of modular and recursive formulations for the inverse dynamics of parallel architecture manipulators in this paper. The modular formulation of mathematical models is attractive especially when existing sub-models may be assembled to create different topologies, e.g., cooperative robotic systems. Recursive algorithms are desirable from the viewpoint of simplicity and ...
In recursive linear models, the multivariate normal joint distribution of all variables exhibits a dependence structure induced by recursive systems of linear structural equations. Such models appear in particular in seemingly unrelated regressions, structural equation modelling, simultaneous equation systems, and in Gaussian graphical modelling. We show that recursive linear models that are ‘b...
Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns to untrusted storage. ORAM may be used in secure processors for encrypted computation and/or software protection. While recursive Path ORAM is currently the most practical ORAM for secure processors, it still incurs large performance and energy overhead and is the performance bottleneck of recently proposed secu...
Diffusion-limited aggregation (DLA) is a useful model for studying such common physical phenomena as dust clustering, unstable fluid flowJ chemical species precipitation, and crystal growth. Simulating the DLA processes using electrostatic analogy is very computation-intensive. Elimination of closed loops in DLA images can significantly reduce the dimensionality of the problem and minimize the ...
Aim of the paper is to describe an application of a fast recursive algorithm to the computation of the local axial moment of a gray level image. The fast algorithm allows to reduce the computation complexity to O(n) where n is the input size. This result is of interest in real time image applications with more than 10 6 pixels. Experiments on real data validate the theoretical previsions.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید