Charles A. Micchelli

Affiliations:
  • University at Albany, SUNY, USA


According to our database1, Charles A. Micchelli authored at least 72 papers between 1974 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Approximation by linear combinations of translates of a single function.
CoRR, 2020

2019
Learning with optimal interpolation norms.
Numer. Algorithms, 2019

Approximation by translates of a single function of functions in space induced by the convolution with a given function.
Appl. Math. Comput., 2019

2016
Corrigendum to "Multivariate approximation by translates of the Korobov function on Smolyak grids" [J. Complexity 29 (2013) 424-437].
J. Complex., 2016

On multivariate discrete least squares.
J. Approx. Theory, 2016

2013
Multivariate approximation by translates of the Korobov function on Smolyak grids.
J. Complex., 2013

On collocation matrices for interpolation and approximation.
J. Approx. Theory, 2013

On discrete ℓ1-regularization.
Adv. Comput. Math., 2013

On computing with the Hilbert spline transform.
Adv. Comput. Math., 2013

On an asymptotic analysis of polynomial approximation to halfband filters.
Adv. Comput. Math., 2013

Proximity algorithms for the L1/TV image denoising model.
Adv. Comput. Math., 2013

Regularizers for structured sparsity.
Adv. Comput. Math., 2013

Finite rank kernels for multi-task learning.
Adv. Comput. Math., 2013

On Sparsity Inducing Regularization Methods for Machine Learning.
Proceedings of the Empirical Inference - Festschrift in Honor of Vladimir N. Vapnik, 2013

2011
Efficient First Order Methods for Linear Composite Regularizers
CoRR, 2011

2010
On Spectral Learning.
J. Mach. Learn. Res., 2010

Functions with spline Spectra and their Applications.
Int. J. Wavelets Multiresolution Inf. Process., 2010

A Family of Penalty Functions for Structured Sparsity.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Modeling posterior probabilities using the linear exponential family.
Proceedings of the INTERSPEECH 2010, 2010

2009
When Is There a Representer Theorem? Vector Versus Matrix Regularizers.
J. Mach. Learn. Res., 2009

Optimal learning of bandlimited functions from localized sampling.
J. Complex., 2009

Theodore J. Rivlin (1926-2006).
J. Approx. Theory, 2009

2008
Universal Multi-Task Kernels.
J. Mach. Learn. Res., 2008

On translation invariant operators which preserve the B-spline recurrence.
Adv. Comput. Math., 2008

2007
Feature space perspectives for learning the kernel.
Mach. Learn., 2007

On the matrix completion problem for multivariate filter bank construction.
Adv. Comput. Math., 2007

A Spectral Regularization Framework for Multi-Task Structure Learning.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006
Universal Kernels.
J. Mach. Learn. Res., 2006

A DC-programming algorithm for kernel selection.
Proceedings of the Machine Learning, 2006

2005
On Learning Vector-Valued Functions.
Neural Comput., 2005

Learning the Kernel Function via Regularization.
J. Mach. Learn. Res., 2005

Learning Multiple Tasks with Kernel Methods.
J. Mach. Learn. Res., 2005

Learning Convex Combinations of Continuously Parameterized Basic Kernels.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004
Kernels for Multi--task Learning.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

A Function Representation for Learning in Banach Spaces.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003
Multivariate Filter Banks Having Matrix Factorizations.
SIAM J. Matrix Anal. Appl., 2003

2002
Fast Collocation Methods for Second Kind Integral Equations.
SIAM J. Numer. Anal., 2002

Discrete Wavelet Petrov-Galerkin Methods.
Adv. Comput. Math., 2002

2001
Binomial Matrices.
Adv. Comput. Math., 2001

2000
On the Cholesky Factorization of the Gram Matrix of Multivariate Functions.
SIAM J. Matrix Anal. Appl., 2000

Approximation by radial bases and neural networks.
Numer. Algorithms, 2000

Maximum entropy and maximum likelihood criteria for feature selection from multivariate data.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2000

1999
A construction of interpolating wavelets on invariant sets.
Math. Comput., 1999

Maximum likelihood estimates for exponential type density families.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

1997
Construction of conjugate quadrature filters with specified zeros.
Numer. Algorithms, 1997

Reconstruction and Decomposition Algorithms for Biorthogonal Multiwavelets.
Multidimens. Syst. Signal Process., 1997

Regularity of multiwavelets.
Adv. Comput. Math., 1997

Spectral factorization of Laurent polynomials.
Adv. Comput. Math., 1997

The Petrov-Galerkin method for second kind integral equations II: multiwavelet schemes.
Adv. Comput. Math., 1997

Design of conjugate quadrature filters having specified zeros.
Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

1996
On weight functions which admit explicit Gauss-Turán quadrature formulas.
Math. Comput., 1996

1994
Norm estimates for the<i>l</i><sup>2</sup>-inverses of multivariate Toeplitz matrices.
Numer. Algorithms, 1994

Dimension-independent bounds on the degree of approximation by neural networks.
IBM J. Res. Dev., 1994

1993
Optimal estimation of linear operators from inaccurate data: A second look.
Numer. Algorithms, 1993

Continuous refinement equations and subdivision.
Adv. Comput. Math., 1993

Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices.
Adv. Comput. Math., 1993

How to Choose an Activation Function.
Proceedings of the Advances in Neural Information Processing Systems 6, 1993

1992
Almost strictly totally positive matrices.
Numer. Algorithms, 1992

Using the refinement equation for the construction of pre-wavelets V: Extensibility of trigonometric polynomials.
Computing, 1992

1991
Using the refinement equation for the construction of pre-wavelets III: Elliptic splines.
Numer. Algorithms, 1991

Using the refinement equation for the construction of pre-wavelets.
Numer. Algorithms, 1991

Using the Refinement Equations for the Construction of Pre-Wavelets II: Powers of Two.
Proceedings of the Curves and Surfaces, 1991

1990
Using parameters to increase smoothness of curves and surfaces generated by subdivision.
Comput. Aided Geom. Des., 1990

1987
An optimal recovery view of Walsh's equiconvergence theorem.
J. Complex., 1987

Computing curves invariant under halving.
Comput. Aided Geom. Des., 1987

Computing surfaces invariant under subdivision.
Comput. Aided Geom. Des., 1987

On the Theory and Application of exponential splines.
Proceedings of the Topics in Multivariate Approximation, 1987

1986
On the piecewise structure of discrete box splines.
Comput. Aided Geom. Des., 1986

1985
Line average algorithm: A method for the computer generation of smooth surfaces.
Comput. Aided Geom. Des., 1985

1984
Subdivision algorithms for the generation of box spline surfaces.
Comput. Aided Geom. Des., 1984

1975
High Order Search Methods for Finding Roots.
J. ACM, 1975

1974
Characterization of Chebyshev approximation by weak Markoff systems.
Computing, 1974


  Loading...