Sciweavers

10891 search results - page 1601 / 2179
» Combining Model Reductions
Sort
View
134
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 5 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 5 months ago
Robust Matrix Decomposition with Outliers
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
Daniel Hsu, Sham M. Kakade, Tong Zhang
164
Voted
CSL
2008
Springer
15 years 5 months ago
User simulation in a stochastic dialog system
We present a new methodology of user simulation applied to the evaluation and refinement of stochastic dialog systems. Common weaknesses of these systems are the scarceness of the...
Francisco Torres, Emilio Sanchis, Encarna Segarra
145
Voted
EAAI
2008
115views more  EAAI 2008»
15 years 5 months ago
Supply chain coordination: A game-theory approach
In a supply chain organized as a network of autonomous enterprises, the main objective of each partner is to optimize his production and supply policy with respect to his own econ...
Jean-Claude Hennet, Yasemin Arda
147
Voted
ECCC
2008
117views more  ECCC 2008»
15 years 5 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...
« Prev « First page 1601 / 2179 Last » Next »