Sciweavers

3229 search results - page 71 / 646
» Mixing
Sort
View
ORL
2008
50views more  ORL 2008»
15 years 3 months ago
Exploiting equalities in polynomial programming
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...
Javier Peña, Juan Carlos Vera, Luis F. Zulu...
ORL
2008
93views more  ORL 2008»
15 years 3 months ago
Polymatroids and mean-risk minimization in discrete optimization
We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...
Alper Atamtürk, Vishnu Narayanan
JAL
2000
119views more  JAL 2000»
15 years 2 months ago
On Markov Chains for Independent Sets
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
Martin E. Dyer, Catherine S. Greenhill
IGARSS
2009
15 years 22 days ago
Abundance Estimation of Spectrally Similar Minerals
This paper evaluates a spectral unmixing method for estimating the partial abundance of spectrally similar minerals in complex mixtures. The method requires formulation of a linea...
Pravesh Debba
CORR
2010
Springer
76views Education» more  CORR 2010»
14 years 10 months ago
Freezing and Sleeping: Tracking Experts that Learn by Evolving Past Posteriors
A problem posed by Freund is how to efficiently track a small pool of experts out of a much larger set. This problem was solved when Bousquet and Warmuth introduced their mixing p...
Wouter M. Koolen, Tim van Erven