417 search results - page 12 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
NIPS
2003
13 years 8 months ago
2003
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
TACAS
2005
Springer
14 years 25 days ago
2005
Springer
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
IDEAL
2004
Springer
14 years 22 days ago
2004
Springer
Abstract— The paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model gener...
ML
2007
ACM
13 years 6 months ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...