Results 71 to 80 of about 2,755,381 (193)
FPU-Supported Running Error Analysis
Acta Polytechnica, 2010 A-posteriori forward rounding error analyses tend to give sharper error estimates than a-priori ones, as they use actual data quantities. One of such a-posteriori analysis – running error analysis – uses expressions consisting of two parts; one generates
T. Zahradnický, R. Lórencz
doaj
Growing and Destroying Catalan-Stanley Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers.
Benjamin Hackl, Helmut Prodinger
doaj +1 more source
Analysis of Virus Algorithms [PDF]
Journal of Computer Science, 2006 Security of wired and wireless networks is the most challengeable in today's computer world. The aim of this study was to give brief introduction about viruses and worms, their creators and characteristics of algorithms used by viruses. Here wired and wireless network viruses are elaborated. Also viruses are compared with human immune system.
Jyoti Kalyani +3 more
openaire +1 more source
Waiting time distributions for pattern occurrence in a constrained sequence [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Valeri T. Stefanov, Wojciech Szpankowski
doaj +1 more source
On the tileability of polygons with colored dominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Chris Worman, Boting Yang
doaj +1 more source
Error Analysis of Miller's Recurrence Algorithm [PDF]
Mathematics of Computation, 1964 Miller’s algorithm is a device for computing the most rapidly decreasing solution of a second-order linear difference equation. In this paper strict upper bounds are given for the errors in the values yielded by the algorithm, and general conclusions are drawn concerning the accuracy of the process.
openaire +1 more source
Error analysis of QR algorithms for computing Lyapunov exponents [PDF]
, 2001 Lyapunov exponents give valuable information about long term dynamics. The discrete and continuous QR algorithms are widely used numerical techniques for computing approximate Lyapunov exponents, although they are not yet supported by a general error ...
Higham, D.J., McDonald, E.J.
core +1 more source
, 2010 Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis.
A. Cournier +17 more
core +1 more source
Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Philippe Dumas +2 more
doaj +1 more source
Uniform subdivision algorithms for curves and surfaces [PDF]
, 1988 A convergence analysis for studying the continuity and differentiability of limit curves generated by uniform subdivision algorithms is presented. The analysis is based on the study of corresponding difference and divided difference algorithms.
Dyn, N, Gregory, JA, Levin, D
core