134 search results - page 19 / 27 » Local Minimax Learning of Approximately Polynomial Functions |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
VLSISP
2010
13 years 5 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
MLG
2007
Springer
14 years 1 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...