Results 1  10
of
716,743
Maximum likelihood from incomplete data via the EM algorithm
 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 10416 (14 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
THE COMPLEXITY OF MULTIPLEPRECISION ARITHMETIC
, 1976
"... In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision required increases as the computation proceeds. We give upper and l ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision required increases as the computation proceeds. We give upper
A multipleprecision division algorithm
 Math. Comp
, 1996
"... Abstract. The classical algorithm for multipleprecision division normalizes digits during each step and sometimes makes correction steps when the initial guess for the quotient digit turns out to be wrong. A method is presented that runs faster by skipping most of the intermediate normalization and ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The classical algorithm for multipleprecision division normalizes digits during each step and sometimes makes correction steps when the initial guess for the quotient digit turns out to be wrong. A method is presented that runs faster by skipping most of the intermediate normalization
THE COMPLEXITY OF MULTIPLEPRECISION
"... In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision required increases as the computation proceeds. We give upper and l ..."
Abstract
 Add to MetaCart
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision required increases as the computation proceeds. We give upper
Fast multipleprecision evaluation of elementary functions
 Journal of the ACM
, 1976
"... XI3STnXC'r. Let f(x) be one of the usual elementary functions (exp, log, artan, sin, cosh, etc.), and let M(n) be the number of singleprecision operations reqmred to multiply nbit integers. It is shown that f(x) can be evaluated, with relative error 0(2'), m O(M(n)log (n)) operations as ..."
Abstract

Cited by 97 (6 self)
 Add to MetaCart
such as f, e, and e'. The algorithms depend on the theory of elhptic integrals, using the arithmeticgeometric mean iteration and ascending Landen transformations. Itsr wol~os Ar~o en~As~s: multipleprecision arithmetic, analytic complexity, arithmeticgeometric mean, computational complexity
A Fortran multipleprecision arithmetic package
 ACM Trans. Math. Softw
, 1978
"... A collection of ANSI Standard Fortran subroutines for performing multipleprecision floatingpoint arithmetic and evaluating elementary and special functions is described. The subroutines are machine independent and the precision is arbitrary, subject to storage limitations. The design of the packa ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
A collection of ANSI Standard Fortran subroutines for performing multipleprecision floatingpoint arithmetic and evaluating elementary and special functions is described. The subroutines are machine independent and the precision is arbitrary, subject to storage limitations. The design
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 641 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations
Adaptive clustering for mobile wireless networks
 IEEE Journal on Selected Areas in Communications
, 1997
"... This paper describes a selforganizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract

Cited by 518 (11 self)
 Add to MetaCart
This paper describes a selforganizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1996
"... We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum and c ..."
Abstract

Cited by 738 (20 self)
 Add to MetaCart
We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum
Results 1  10
of
716,743