Results 1 - 10 of 160,125

Maximum likelihood from incomplete data via the EM algorithm

by A. P. Dempster, N. M. Laird, D. B. Rubin - JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B , 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract - Cited by 11972 (17 self) - Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value

Computational Geometry Algorithms Library

by Pierre Alliez, Andreas Fabri, Efi Fogel , 2008
"... The CGAL Open Source Project provides easy access to efficient and reliable geometric algorithms in the form of a C++ library, offering geometric data structures and algorithms, which are efficient, robust, easy to use, and easy to integrate in existing software. The usage of de facto standard libra ..."
Abstract - Add to MetaCart
The CGAL Open Source Project provides easy access to efficient and reliable geometric algorithms in the form of a C++ library, offering geometric data structures and algorithms, which are efficient, robust, easy to use, and easy to integrate in existing software. The usage of de facto standard

CGAL - the computational geometry algorithm library

by Efi Fogel , Monique Teillaud - In Proceedings of the 10th International Meshing Roundtable
"... Abstract The Computational Geometry Algorithms Library (CGAL) is an open source software library that provides industrial and academic users with easy access to reliable implementations of efficient geometric algorithms. Usage. CGAL is used in a diverse range of domains requiring geometric computat ..."
Abstract - Cited by 24 (0 self) - Add to MetaCart
Abstract The Computational Geometry Algorithms Library (CGAL) is an open source software library that provides industrial and academic users with easy access to reliable implementations of efficient geometric algorithms. Usage. CGAL is used in a diverse range of domains requiring geometric

On the design of CGAL a computational geometry algorithms library

by Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr - SOFTW. – PRACT. EXP , 1999
"... CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. We discuss the major ..."
Abstract - Cited by 103 (15 self) - Add to MetaCart
CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. We discuss

Finding Coarse Grained Parallelism in Computational Geometry Algorithms

by Volodymyr Beletskyy
"... Abstract. A technique, permitting automatic finding coarse grained parallelism in algorithms presented with arbitrary nested loops, is presented. The technique is based on finding affine space partition mappings. The main advantage of this technique is that it allows us to form constraints for findi ..."
Abstract - Add to MetaCart
can be applied for parallelizing computational geometry algorithms by means of two examples. 1

Generic Geometric Programming in the Computational Geometry Algorithms Library

by Remco C. Veltkamp - Computer Graphics Forum , 1997
"... This paper describes a number of design issues and programming paradigms that aect the development of Cgal, the computational geometry algorithms library. Genericity of the library is achieved by concepts such as templates, iterators, and traits classes. This allows the application programmer to plu ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
This paper describes a number of design issues and programming paradigms that aect the development of Cgal, the computational geometry algorithms library. Genericity of the library is achieved by concepts such as templates, iterators, and traits classes. This allows the application programmer

Designing a Computational Geometry Algorithms Library

by Stefan Schirra - Lecture Notes for Advanced School on Algorithmic Foundations of Geographic Information Systems, CISM , 1996
"... Introduction Geometric problems arise in many areas. Computer graphics, robotics, manufacturing, and geographic information systems are some examples. Often the same geometric subproblems are to be solved. Hence a library providing solutions for core problems in geometric computing has a wide range ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
of computational geometry is now very close to a state where it can provide such a library of geometric algorithms. Over the past twenty years many algorithms for geometric problems have been developed by computational geometers. Many of these algorithms clearly have no direct impact for geometric computing

Audio Fingerprint Extraction Using an Adapted Computational Geometry Algorithm

by Marios Poulos, Ioannis Deliyannis, Andreas Floros
"... This work presents an adapted version of the Computational Geometry Algorithm (CGA) used for the development of audio-based applications and services. The CGA algorithm analyses an audio stream and produces a unique set of points that can be considered to be the audio data “fingerprint”. It is shown ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This work presents an adapted version of the Computational Geometry Algorithm (CGA) used for the development of audio-based applications and services. The CGA algorithm analyses an audio stream and produces a unique set of points that can be considered to be the audio data “fingerprint

Efficient Audio Fingerprint Application Verification Using the Adapted Computational Geometry Algorithm

by Marios Poulos, Ioannis Deliyannis, Andreas Floros
"... An earlier work of the authors introduced an adapted version of the Computational Geometry Algorithm (CGA) designed to analyse an audio stream and produce a unique coding-independent fingerprint. As the adaptability and the induced calculation load of the proposed algorithm form a key characteristic ..."
Abstract - Add to MetaCart
An earlier work of the authors introduced an adapted version of the Computational Geometry Algorithm (CGA) designed to analyse an audio stream and produce a unique coding-independent fingerprint. As the adaptability and the induced calculation load of the proposed algorithm form a key

The geometry of algorithms with orthogonality constraints

by Alan Edelman, Tomás A. Arias, Steven T. Smith - SIAM J. MATRIX ANAL. APPL , 1998
"... In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal proces ..."
Abstract - Cited by 640 (1 self) - Add to MetaCart
In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal
Results 1 - 10 of 160,125