Sciweavers

15 search results - page 2 / 3
» Kernelization and Sparseness: the Case of Dominating Set
Sort
View
SIAMSC
2008
132views more  SIAMSC 2008»
13 years 5 months ago
Stochastic Preconditioning for Diagonally Dominant Matrices
Abstract. This paper presents a new stochastic preconditioning approach for large sparse matrices. For the class of matrices that are row-wise and column-wise irreducibly diagonall...
Haifeng Qian, Sachin S. Sapatnekar
JMLR
2012
11 years 7 months ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
ICML
2008
IEEE
14 years 6 months ago
Sparse multiscale gaussian process regression
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
Bernhard Schölkopf, Christian Walder, Kwang I...
NIPS
2004
13 years 6 months ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan
HVC
2007
Springer
108views Hardware» more  HVC 2007»
13 years 11 months ago
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...
David N. Jansen, Joost-Pieter Katoen, Marcel Olden...