Sciweavers

3096 search results - page 209 / 620
» The Generalized FITC Approximation
Sort
View
NIPS
2003
15 years 6 months ago
Laplace Propagation
We present a novel method for approximate inference in Bayesian models and regularized risk functionals. It is based on the propagation of mean and variance derived from the Lapla...
Alexander J. Smola, Vishy Vishwanathan, Eleazar Es...
ICML
2010
IEEE
15 years 6 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
146
Voted
DAM
2008
78views more  DAM 2008»
15 years 5 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
126
Voted
DM
2008
88views more  DM 2008»
15 years 5 months ago
Packing triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
Gordana Manic, Yoshiko Wakabayashi
AMC
2006
80views more  AMC 2006»
15 years 5 months ago
Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is proposed to evaluate the leftmost eigenpairs of the generalized symmetric positive defi...
Luca Bergamaschi, Angeles Martinez, Giorgio Pini