The following pages link to (Q4226567):
Displaying 50 items.
- Improved particle filters for multi-target tracking (Q418990) (← links)
- Tsallis entropy measure of noise-aided information transmission in a binary channel (Q434099) (← links)
- The complexity of some topological inference problems (Q486691) (← links)
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions (Q613579) (← links)
- Stochastic computation based on orthogonal expansion of random fields (Q660280) (← links)
- What is the complexity of volume calculation? (Q700188) (← links)
- Introduction to convex optimization in financial markets (Q715237) (← links)
- On the tractability of linear tensor product problems in the worst case (Q731971) (← links)
- Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation (Q817339) (← links)
- Generalized tractability for multivariate problems. II: Linear tensor product problems, linear information, and unrestricted tractability (Q839659) (← links)
- The quantum setting with randomized queries for continuous problems (Q850543) (← links)
- Approximation of infinitely differentiable multivariate functions is not strongly tractable (Q870341) (← links)
- Learning smooth shapes by probing (Q871061) (← links)
- Tractability of quasilinear problems. I: General results (Q880024) (← links)
- Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information (Q883336) (← links)
- Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements (Q890228) (← links)
- Tight tractability results for a model second-order Neumann problem (Q896550) (← links)
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces (Q935068) (← links)
- Are unbounded linear operators computable on the average for Gaussian measures? (Q945917) (← links)
- Complexity of Gaussian-radial-basis networks approximating smooth functions (Q998978) (← links)
- On the power of standard information for multivariate approximation in the worst case setting (Q1019157) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting (Q1029550) (← links)
- Tractability of multivariate integration for periodic functions (Q1347849) (← links)
- Sufficient conditions for fast quasi-Monte Carlo convergence (Q1401997) (← links)
- Open problems for tractability of multivariate integration. (Q1402005) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- What is the complexity of Stieltjes integration? (Q1578424) (← links)
- Delayed curse of dimension for Gaussian integration (Q1578431) (← links)
- Quadrature formulas for the Wiener measure (Q1578512) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration (Q1599199) (← links)
- Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
- Computational complexity of the integration problem for anisotropic classes (Q1776161) (← links)
- The effective dimension and quasi-Monte Carlo integration (Q1869960) (← links)
- Algorithmic analysis of irrational rotations in a single neuron model (Q1869962) (← links)
- A constructive approach to strong tractability using quasi-Monte Carlo algorithms (Q1872630) (← links)
- Finite-order weights imply tractability of linear multivariate problems (Q1881675) (← links)
- Finite-order weights imply tractability of multivariate integration (Q1883584) (← links)
- \(I\)-binomial scrambling of digital nets and sequences (Q1887112) (← links)
- The power of various real-valued quantum queries (Q1888377) (← links)
- A fast algorithm to compute \(L(1/2, f\times \chi_q)\) (Q1937300) (← links)
- Intractability results for positive quadrature formulas and extremal problems for trigonometric polynomials (Q1961047) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals (Q1996878) (← links)
- Weaker convergence criteria for Traub's method (Q2074936) (← links)
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls (Q2252143) (← links)
- Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments (Q2302488) (← links)
- A near-stationary subspace for ridge approximation (Q2310068) (← links)
- Gauss-Christoffel quadrature for inverse regression: applications to computer experiments (Q2329776) (← links)