We present a deterministic annealing variant of the EM algorithm for maximum likelihood parameter estimation problems. In our approach, the EM process is reformulated as the problem of minimizing the thermodynamic free energy by using the principle of maximum entropy and statistical mechanics analogy. Unlike simulated annealing approaches, this minimization is deterministically performed. Moreo...

Pliable index coding considers a server with m messages, and n clients where each has as side information a subset of the messages. We seek to minimize the number of transmissions the server should make, so that each client receives (any) one message she does not already have. Previous work has shown that the server can achieve this using O(log(n)) transmissions and needs at least Ω(log(n)) tra...

The minimum covariance determinant (MCD) method is a robust estimator of multivariate location and scatter (Rousseeuw, 1984). The MCD is highly resistant to outliers, and it is often applied by itself and as a building block for other robust multivariate methods. Computing the exact MCD is very hard, so in practice one resorts to approximate algorithms. Most often the FASTMCD algorithm of Rouss...

Abstract. Subset selection is a method for selecting a subset of columns from a real matrix, so that the subset represents the entire matrix well and is far from being rank deficient. We begin by extending a deterministic subset selection algorithm to matrices that have more columns than rows. Then we investigate a two-stage subset selection algorithm that utilizes a randomized stage to pick a ...

IJSER © 2015 http://www.ijser.org A Novel Method To Construct Deterministic Finite Automata From AGiven Regular Grammar K.Senthil Kumar D.Malathi Abstract—Membership checking is an important task in language formalism. In regular Language ,Deterministic Finite Automata plays membership checking in a convenient way. Regular language is normally represented by regular expression from which peopl...

space-time adaptive processing is used for clutter mitigation in airborne radars. in this paper, deterministic clutter subspace and direct data domain methods are introduced due to the fact that space-time adaptive processing algorithm requires estimating covariance matrix, limited training data and high complexity in processing. in first proposed method, filter coefficients are calculated by e...

We describe a framework and an algorithm for solving hybrid influence diagrams with discrete, continuous, and deterministic chance variables, and discrete and continuous decision variables. A continuous chance variable in an influence diagram is said to be deterministic if its conditional distributions have zero variances. The solution algorithm is an extension of Shenoy’s fusion algorithm for ...

We present a deterministic linear time algorithm for the Tree Path Maxima problem. As a corollary, we obtain a deterministic linear time algorithm for checking whether a given spanning tree T of a weighted graph is a minimum spanning tree.