417 search results - page 28 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
120
click to vote
COLT
2004
Springer
15 years 7 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
132
click to vote
IJAR
2006
15 years 3 months ago
2006
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
133
Voted
SODA
2010
ACM
16 years 21 days ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
142
click to vote
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
116
click to vote
PAMI
2000
15 years 3 months ago
2000
I consider the problem of finding all the modes of a mixture of multivariate Gaussian distributions, which has applications in clustering and regression. I derive exact formulas f...