417 search results - page 27 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
APAL
2007
13 years 8 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
NIPS
2001
13 years 9 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...