Sciweavers

3415 search results - page 220 / 683
» Lower bounds on kernelization
Sort
View
COMBINATORICS
2002
90views more  COMBINATORICS 2002»
15 years 6 months ago
Ternary Constant Weight Codes
Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
Patric R. J. Östergård, Mattias Svanstr...
FOCM
2008
140views more  FOCM 2008»
15 years 6 months ago
Online Gradient Descent Learning Algorithms
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...
Yiming Ying, Massimiliano Pontil
JMLR
2008
95views more  JMLR 2008»
15 years 6 months ago
Learning Similarity with Operator-valued Large-margin Classifiers
A method is introduced to learn and represent similarity with linear operators in kernel induced Hilbert spaces. Transferring error bounds for vector valued large-margin classifie...
Andreas Maurer
JMLR
2010
118views more  JMLR 2010»
15 years 1 months ago
Hilbert Space Embeddings and Metrics on Probability Measures
A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing, and independence testing....
Bharath K. Sriperumbudur, Arthur Gretton, Kenji Fu...
AUSAI
2004
Springer
15 years 12 months ago
Set Bounds and (Split) Set Domain Propagation Using ROBDDs
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey