161 search results - page 11 / 33 » Methods for convex and general quadratic programming |
177
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
154
click to vote
ESANN
2004
15 years 5 months ago
2004
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
123
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in t...
140
click to vote
NIPS
2007
15 years 5 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
159
Voted
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Eigenvalue problems are rampant in machine learning and statistics and appear in the context of classification, dimensionality reduction, etc. In this paper, we consider a cardina...