Sciweavers

957 search results - page 189 / 192
» Conditional Density Estimation with Class Probability Estima...
Sort
View
98
Voted
IPCO
2010
125views Optimization» more  IPCO 2010»
15 years 1 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CVPR
2010
IEEE
14 years 12 months ago
Label propagation in video sequences
This paper proposes a probabilistic graphical model for the problem of propagating labels in video sequences, also termed the label propagation problem. Given a limited amount of ...
Vijay Badrinarayanan, Fabio Galasso, Roberto Cipol...
COR
2008
122views more  COR 2008»
14 years 11 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
PRL
2007
138views more  PRL 2007»
14 years 11 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 years 10 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis