Results 251 to 260 of about 425,347 (290)
Some of the next articles are maybe not open access.

Termination analysis with recursive calling graphs

Journal of Network and Computer Applications, 2014
As one of the significant aspects for green software systems, termination analysis is related to the optimization of the resource utilization. The approach for size-change termination principle was first proposed by Lee, Jones and Ben-Amram in 2001, which is an effective method for automatic termination analysis. According to its abstracted constructs (
Teng Long, Wenhui Zhang
openaire   +1 more source

Analysis of Recursive Probabilistic Models

2006
In this talk we will discuss recent work on the modeling and analysis of systems that involve recursion and probability. Both, recursion and probability, are fundamental constructs that arise in a wide variety of settings in computer science and other disciplines.
openaire   +1 more source

Recursive region segmentation by analysis of histograms

ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
Recursive segmentation of an image into regions using histograms is one of the most widely used techniques for image segmentation. At CMU, several versions of a region segmentation program have been developed based on this technique (Ohlander, Price, Shafer and Kanade).
Steven A. Shafer, Takeo Kanade
openaire   +1 more source

Convergence analysis for recursive Hammerstein identification

Automatica, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Per Mattsson, Torbjörn Wigren
openaire   +2 more sources

Recursive Principal Component Analysis of Graphs

2007
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devised by Recursive Principal Components Analysis learning. These representations are derived from eigenanalysis of extended vectorial representations of the input graphs ...
MICHELI, ALESSIO, A. SPERDUTI
openaire   +2 more sources

Data flow analysis of recursive procedures

ACM SIGPLAN Notices, 1988
Data flow analysis is a technique used to detect suspicious variable usage within a program. Its evaluation requires analysis of the flow graphs of the program. This causes difficulties when the program contains recursive procedures because in order to fully evaluate each procedure, the data flow value of its own recursive invocation needs to be known ...
P. Fairfield, Michael A. Hennell
openaire   +1 more source

XSLT streamability analysis with recursive schemas

2012 Sixth International Conference on Research Challenges in Information Science (RCIS), 2012
We present an algorithm which checks whether a restricted XSLT stylesheet can be applied to documents conforming to a given schema using the Simple Streaming XML Transducer algorithm of Dvořakova et al. [1], [2]. Our contribution consists in extending the set of admissible schemas by allowing the choice constructor and recursive element definitions. We
openaire   +1 more source

Static analysis of recursive data structures

1998
The static analysis of imperative programs is made difficult by the unrestricted pointer structures which makes their analysis imprecise. A static analysis approach is proposed for a class of graph-like data structures, for which the programmer infuses extra structural information in their description using a Markov algorithm. The method is illustrated
D. K. Arvind 0001, T. A. Lewis
openaire   +1 more source

L p -Computability in Recursive Analysis

Proceedings of the American Mathematical Society, 1984
Intrinsic \(L^ p\)-computability is a generalization of the classical Grzegorczyk notion of computability for a continuous function. Thus f is \(L^ p\)-computable if f is the effective limit in \(L^ p\)-norm of any one of the following equivalent conditions: (i) a computable sequence of polynomials, (ii) a computable sequence of trigonometric ...
Pour-El, Marian Boykan, Richards, Ian
openaire   +2 more sources

Robust recursive AR speech analysis

Signal Processing, 1995
Abstract In this paper a new robust recursive method of estimating the linear prediction parameters of an auto-regressive speech signal model using weighted least squares with variable forgetting factors (VVFs) is described. The proposed robust recursive least-squares (RRLS) method differs from the conventional recursive least-squares (RLS) method by
Branko D. Kovacevic   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy