The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Structure of approximate solutions of variational problems with extended-valued convex integrands”

Generalized Characterization of the Convex Envelope of a Function

Fethi Kadhi (2010)

RAIRO - Operations Research

Similarity:

We investigate the minima of functionals of the form [ a , b ] g ( u ˙ ( s ) ) d s where is strictly convex. The admissible functions u : [ a , b ] are not necessarily convex and satisfy u f on , , , is a fixed function on . We show that the minimum is attained by f ¯ , the convex envelope of .

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by M V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i V is controlled by . Given a set M V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 E E 2 ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by M V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i V is controlled by . Given a set M V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 E E 2 ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

On the asymptotic properties of a simple estimate of the Mode

Christophe Abraham, Gérard Biau, Benoît Cadre (2010)

ESAIM: Probability and Statistics

Similarity:

We consider an estimate of the mode of a multivariate probability density with support in d using a kernel estimate drawn from a sample . The estimate is defined as any in {} such that f n ( x ) = max i = 1 , , n f n ( X i ) . It is shown that behaves asymptotically as any maximizer θ ^ n of . More precisely, we prove that for any sequence ( r n ) n 1 of positive real numbers such that r n and r n d log n / n 0 , one has r n θ n - θ ^ n 0 in probability. The asymptotic normality of follows without further work.