Sciweavers

4114 search results - page 253 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
JMLR
2010
187views more  JMLR 2010»
15 years 1 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
ALT
2006
Springer
15 years 10 months ago
Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
In this paper the sequential prediction problem with expert advice is considered when the loss is unbounded under partial monitoring scenarios. We deal with a wide class of the par...
Chamy Allenberg, Peter Auer, László ...
ICIP
2003
IEEE
16 years 8 months ago
An integrated algorithm of incremental and robust PCA
Principal Component Analysis (PCA) is a well-established technique in image processing and pattern recognition. Incremental PCA and robust PCA are two interesting problems with nu...
Yongmin Li Li, Li-Qun Xu, Jason Morphett, Richard ...
ICML
2007
IEEE
16 years 7 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...
CEC
2008
IEEE
16 years 1 months ago
A contour method in population-based stochastic algorithms
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
Ying Lin, Jun Zhang, Lu-kai Lan