417 search results - page 19 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
SIAMCO
2000
13 years 8 months ago
2000
In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method ...
TIT
2002
13 years 8 months ago
2002
Principal curves, like principal components, are a tool used in multivariate analysis for ends like feature extraction. Defined in their original form, principal curves need not ex...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
COMPGEOM
2011
ACM
13 years 11 hour ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...