Sciweavers

417 search results - page 28 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
COLT
2004
Springer
14 years 6 days ago
A New PAC Bound for Intersection-Closed Concept Classes
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...
Peter Auer, Ronald Ortner
IJAR
2006
125views more  IJAR 2006»
13 years 8 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
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 ...
Vladik Kreinovich, Scott Ferson
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
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...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
MOBIHOC
2007
ACM
14 years 8 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
PAMI
2000
133views more  PAMI 2000»
13 years 8 months ago
Mode-Finding for Mixtures of Gaussian Distributions
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...
Miguel Á. Carreira-Perpiñán