The following pages link to On the power of adaption (Q2565198):
Displaying 35 items.
- Adaptive sensing performance lower bounds for sparse signal detection and support estimation (Q470072) (← links)
- Automatic integration using asymptotically optimal adaptive simpson quadrature (Q495532) (← links)
- Rigorous confidence bounds for MCMC under a geometric drift condition (Q617654) (← links)
- On sequential and parallel solution of initial value problems (Q911713) (← links)
- Information-based numerical practice (Q1102700) (← links)
- On adaption with noisy information (Q1113867) (← links)
- On the adaptive and continuous information problems (Q1263941) (← links)
- On adaptive information with varying cardinality for linear problems with elliptically contoured measures (Q1263942) (← links)
- Optimal integration of Lipschitz functions with a Gaussian weight (Q1265143) (← links)
- Uniform reconstruction of Gaussian processes (Q1275934) (← links)
- Recovery algorithms for high-dimensional rank one tensors (Q1801175) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- Automatic approximation using asymptotically optimal adaptive interpolation (Q2066201) (← links)
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls (Q2252143) (← links)
- Local adaption for approximation and minimization of univariate functions (Q2396714) (← links)
- Complexity of approximation of functions of few variables in high dimensions (Q2431335) (← links)
- Simple Monte Carlo and the Metropolis algorithm (Q2465298) (← links)
- Optimal approximation of elliptic problems by linear and nonlinear mappings. II (Q2507592) (← links)
- Adaption allows efficient integration of functions with unknown singularities (Q2574952) (← links)
- Some Results on the Complexity of Numerical Integration (Q2957029) (← links)
- The power of adaption for approximating functions with singularities (Q3055072) (← links)
- Adaptation on Rugged Landscapes (Q4356656) (← links)
- High dimensional numerical problems (Q4377209) (← links)
- Adaptive wavelet methods for elliptic operator equations: Convergence rates (Q4517511) (← links)
- A new algorithm and worst case complexity for Feynman-Kac path integration. (Q5926791) (← links)
- Tractability of the approximation of high-dimensional rank one tensors (Q5962914) (← links)
- LINEAR AND NON-LINEAR WAVELET APPROXIMATIONS OF FUNCTIONS OF LIPSCHITZ CLASS AND RELATED CLASSES USING THE HAAR WAVELET SERIES (Q6054604) (← links)
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case (Q6154554) (← links)
- Monte Carlo integration of \(C^r\) functions with adaptive variance reduction: an asymptotic analysis (Q6161576) (← links)
- A Universal Median Quasi-Monte Carlo Integration (Q6190296) (← links)
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces (Q6193948) (← links)
- Homogeneous algorithms and solvable problems on cones (Q6540037) (← links)
- Randomized complexity of mean computation and the adaption problem (Q6614418) (← links)
- Randomized approximation of summable sequences -- adaptive and non-adaptive (Q6632941) (← links)
- How sharp are error bounds? -- Lower bounds on quadrature worst-case errors for analytic functions -- (Q6633129) (← links)
