Sciweavers

7519 search results - page 1423 / 1504
» Optimizing Generic Functions
Sort
View
JMLR
2010
103views more  JMLR 2010»
14 years 9 months ago
Regret Bounds and Minimax Policies under Partial Monitoring
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
Jean-Yves Audibert, Sébastien Bubeck
SIAMDM
2010
113views more  SIAMDM 2010»
14 years 9 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
116
Voted
TEC
2010
173views more  TEC 2010»
14 years 9 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
TMM
2010
270views Management» more  TMM 2010»
14 years 9 months ago
Sequence Multi-Labeling: A Unified Video Annotation Scheme With Spatial and Temporal Context
Abstract--Automatic video annotation is a challenging yet important problem for content-based video indexing and retrieval. In most existing works, annotation is formulated as a mu...
Yuanning Li, YongHong Tian, Ling-Yu Duan, Jingjing...
139
Voted
TNN
2010
176views Management» more  TNN 2010»
14 years 9 months ago
On the weight convergence of Elman networks
Abstract--An Elman network (EN) can be viewed as a feedforward (FF) neural network with an additional set of inputs from the context layer (feedback from the hidden layer). Therefo...
Qing Song
« Prev « First page 1423 / 1504 Last » Next »