Results 271 to 280 of about 1,094,599 (317)

An Algorithm for Haplotype Analysis

Journal of Computational Biology, 1997
This paper proposes an algorithm for haplotype analysis based on a Monte Carlo method. Haplotype configurations are generated according to the distribution of joint haplotypes of individuals in a pedigree given their phenotype data, via a Markov chain Monte Carlo algorithm.
Shili Lin, Terence P. Speed
openaire   +2 more sources

Algorithm for Performance Analysis of the IMM Algorithm

IEEE Transactions on Aerospace and Electronic Systems, 2011
The interacting multiple model (IMM) algorithm has been used in many applications. However, performance analysis of the IMM algorithm is difficult because it uses a set of Kalman filters that are coupled with each other. We present an algorithm to compute the means and cross-covariances of the residuals and state estimation errors of these Kalman ...
Chze Eng Seah, Inseok Hwang 0002
openaire   +1 more source

Analysis of the rubberband algorithm

Image and Vision Computing, 2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The curve's length is defined to be that of the minimum-length polygonal curve (MLP) contained and complete in the tube of the curve.
Fajie Li, Reinhard Klette
openaire   +1 more source

Analysis of sorting algorithms

Proceedings of the June 4-8, 1973, national computer conference and exposition on - AFIPS '73, 1971
By analyzing an algorithm, we mean to study the performance of an algorithm including the assertion of its correctness and a determination of the cost of its execution. Although a given algorithm is often analyzed in a particular way that is most suitable for such an algorithm, we are more interested in general procedures and techniques that can be ...
openaire   +1 more source

Algorithms for Chordal Analysis

Computer Music Journal, 2002
Computer Music Journal, 26:2, pp. 27–49, Summer 2002 O 2002 Massachusetts Institute of Technology. The harmonic analysis of tonal music by computer is an important area of interest in the computer music research community. While the problem is interesting in its own right, the ability to parse and use chords and harmonies in a tonal composition also ...
Bryan Pardo, William P. Birmingham
openaire   +1 more source

Algorithms for color analysis

Proceedings of the 1985 ACM SIGSMALL symposium on Small systems - SIGSMALL '85, 1985
The usual algorithms for the analysis and synthesis of woven textile structures assume, in general, that the interlacement data is binary, and that this data corresponds on a one-to-one basis with the visible pattern exhibited by a cloth constructed of just two colors.
Josiah A. Hoskins, W. D. Hoskins, J. L. W. May   +2 more
openaire   +1 more source

Analysis of a shellsort algorithm

BIT, 1973
D. L. Shell published in 1959, [4], a fast algorithm for internal sorting. R. M. Frank and R. B. Lazarus pointed out in 1960, [3], a disadvantage in the original design of the algorithm and changes were proposed based on heuristic arguments. J. Boothroyd took care of Frank and Lazarus objections in an elegant algorithm published 1963, [1]. If we change
openaire   +2 more sources

Analysis of thinning algorithms

Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,, 2003
Uses a combinatorial approach to analyse the differences of thinning algorithms among iteration and sub-iteration, thinning by coordinate and by edges of patterns. The authors also propose a serial model thinning algorithm in which the skeletons only consist of three types of points: connected points, end-points, and hole-points. >
Edward Y. Y. Zhang, Patrick S. P. Wang
openaire   +1 more source

Analysis of Covariance Algorithms

Biometrics, 1982
Computational algorithms specific to the analysis of covariance are discussed for the treatment of both balanced and unbalanced data. The use of covariance algorithms in the solution of missing data problems is also considered.
openaire   +1 more source

An analysis of the GLVQ algorithm

IEEE Transactions on Neural Networks, 1995
Generalized learning vector quantization (GLVQ) has been proposed in as a generalization of the simple competitive learning (SCL) algorithm. The main argument of GLVQ proposal is its superior insensitivity to the initial values of the weights (code vectors).
Ana Isabel González, Manuel Graña, Alicia D'Anjou   +2 more
openaire   +2 more sources