The problem of locating local maxima and minima of a function from approximate measurement results is vital for many physical applications: in spectral analysis, chemical species are identified by locating local maxima of the spectra; in radioastronomy, sources of celestial radio emission and and their subcomponents are identified by locating local maxima of the measured brightness of the radio...

A new approach to finding good local maxima of the likelihood function based on synthesizing information from two local maxima is presented. We investigate the coupled EM algorithm (CoEM) for coupling local maxima solutions from two separate EM runs for the multinomial mixture model. The CoEM algorithm probabilistically splits and merges multiple latent states based on conditional independence ...

Combinatorics, Probability and Computing / Volume 25 / Issue 04 / July 2016, pp 633 640 DOI: 10.1017/S0963548315000322, Published online: 21 December 2015 Link to this article: http://journals.cambridge.org/abstract_S0963548315000322 How to cite this article: HUNTER SPINK (2016). Local Maxima of Quadratic Boolean Functions. Combinatorics, Probability and Computing, 25, pp 633-640 doi:10.1017/S0...

We present a useful formula for the expected number of maxima of a normal process ξ(t) that occur below a levelu. In the derivation we assume chiefly that ξ(t), ξ(t), and ξ(t) have, with probability one, continuous 1 dimensional distributions and expected values of zero. The formula referred to above is then used to find the expected number of maxima below the level u for the random algebraic p...

We explore the applicability of a sampling method devised by J. Garnier and L. Kallel (SIAM J. Discrete Math., 2002) to approximate the number of local maxima in search spaces induced by k-SAT instances and a simple neighbourhood relation. The objective function is given by the number of satisfied clauses. Although the problem setting for k-SAT instances does not meet all pre-conditions require...