Sciweavers

1326 search results - page 31 / 266
» Approximate Tree Kernels
Sort
View
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
14 years 2 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
MFCS
2001
Springer
14 years 1 months ago
On the Approximability of the Steiner Tree Problem
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
Martin Thimm
ESANN
2004
13 years 10 months ago
Sparse Bayesian kernel logistic regression
In this paper we present a simple hierarchical Bayesian treatment of the sparse kernel logistic regression (KLR) model based MacKay's evidence approximation. The model is re-p...
Gavin C. Cawley, Nicola L. C. Talbot
NIPS
2004
13 years 10 months ago
Using the Equivalent Kernel to Understand Gaussian Process Regression
The equivalent kernel [1] is a way of understanding how Gaussian process regression works for large sample sizes based on a continuum limit. In this paper we show (1) how to appro...
Peter Sollich, Christopher K. I. Williams
IJON
2007
114views more  IJON 2007»
13 years 8 months ago
Ridgelet kernel regression
In this paper, a ridgelet kernel regression model is proposed for approximation of high dimensional functions. It is based on ridgelet theory, kernel and regularization technology ...
Shuyuan Yang, Min Wang, Licheng Jiao