44 search results - page 5 / 9 » Approximation Bounds for Some Sparse Kernel Regression Algor... |
SODA
2012
ACM
11 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
AAECC
2005
Springer
13 years 6 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
NIPS
2001
13 years 8 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...