Sciweavers

37 search results - page 3 / 8
» Error bounds for GMLS derivatives approximations of Sobolev ...
Sort
View
JMLR
2012
11 years 10 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
ICIP
2004
IEEE
14 years 9 months ago
Rate-distortion bounds for motion compensated rate scalable video coders
In this paper, we derive and evaluate theoretical ratedistortion performance bounds for scalable video compression algorithms which use a single motion-compensated prediction (MCP...
Gregory W. Cook, Josep Prades-Nebot, Edward J. Del...
TNN
2010
216views Management» more  TNN 2010»
13 years 2 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
MP
2008
126views more  MP 2008»
13 years 7 months ago
Geometry of interpolation sets in derivative free optimization
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
Andrew R. Conn, Katya Scheinberg, Luís N. V...
DATE
1999
IEEE
101views Hardware» more  DATE 1999»
13 years 11 months ago
Polynomial Methods for Allocating Complex Components
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
James Smith, Giovanni De Micheli