Sciweavers

1326 search results - page 138 / 266
» Approximate Tree Kernels
Sort
View
ICML
2005
IEEE
14 years 10 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 3 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
EMNLP
2009
13 years 7 months ago
Feature-Rich Translation by Quasi-Synchronous Lattice Parsing
We present a machine translation framework that can incorporate arbitrary features of both input and output sentences. The core of the approach is a novel decoder based on lattice...
Kevin Gimpel, Noah A. Smith
ICIP
1995
IEEE
14 years 1 months ago
Error bound for multi-stage synthesis of narrow bandwidth Gabor filters
This paper develops an error bound for narrow bandwidth Gabor filters synthesized using multiple stages. It is shown that the error introduced by approximating narrow bandwidth Ga...
R. Neil Braithwaite, Bir Bhanu