Fast Algorithms for Component-By-Component Construction of Rank-$1$ Lattice Rules in Shift-Invariant Reproducing Kernel {H}ilbert Spaces

Mathematics of Computation - United States
doi 10.1090/s0025-5718-06-01785-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Component-By-Component Construction of Good Lattice Rules

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2001English

Fast Independent Component Analysis in Kernel Feature Spaces

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Reproducing Kernel Hilbert Spaces

2019English

Component Rank: Relative Significance Rank for Software Component Search

2003English

Reproducing Kernel Banach Spaces for Machine Learning

2009English

Reproducing Kernel Hilbert Spaces for Spike Train Analysis

2008 IEEE International Conference on Acoustics, Speech and Signal Processing
2008English

Dimensionality Reduction for Supervised Learning With Reproducing Kernel Hilbert Spaces

2003English

Identification of Time-Varying Systems in Reproducing Kernel Hilbert Spaces

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2008English

The Schur Algorithm, Reproducing Kernel Spaces and System Theory

Mathematical Gazette
Mathematics
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy