Computing the MAP assignment in graphical models is generally intractable. As a result, for discrete graphical models, the MAP problem is often approximated using linear programming relaxations. Much research has focused on characterizing when these LP relaxations are tight, and while they are relatively well-understood in the discrete case, only a few results are known for their continuous ana...

Abstract We study the inverse problem of estimating a field u from data comprising a finite set of nonlinear functionals of u, subject to additive noise; we denote this observed data by y. Our interest is in the reconstruction of piecewise continuous fields u in which the discontinuity set is described by a finite number of geometric parameters a. Natural applications include groundwater flow a...

For the eigenvalue function on symmetric matrices, we have gathered a number of it’s properties.We show that this map has the properties of continuity, strict continuity, directional differentiability, Frechet differentiability, continuous  differentiability. Eigenvalue function will be extended to a larger set of matrices and then the listed properties will prove again.

Let ? be an open connected subset of the complex plane C and let T be a bounded linear operator on a Hilbert space H. For ? in ? let e the orthogonal projection onto the null-space of T-?I . We discuss the necessary and sufficient conditions for the map ?? to b e continuous on ?. A generalized Gram- Schmidt process is also given.

It is well known that a continuous piecewise monotone interval map with positive topological entropy is semiconjugate to a map of a constant slope and the same entropy, and if it is additionally transitive then this semiconjugacy is actually a conjugacy. We generalize this result to piecewise continuous piecewise monotone interval maps, and as a consequence, get it also for piecewise monotone g...

a 1993 result of j. llibre, and m. misiurewicz, (theorem a [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. also a 1980 result of l.s. block, j. guckenheimer, m. misiurewicz and l.s. young (lemma 1.5 [3]) states that if g is an a-graph of f then h(g) ? h( f ). in this pap...