Computing data distribution from query selectivities
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 1424290 (Why is no real title available?)
- A (slightly) faster algorithm for klee's measure problem
- A decision-theoretic generalization of on-line learning and an application to boosting
- A sublinear-time randomized approximation algorithm for matrix games
- Adaptive game playing using multiplicative weights
- Algorithms for ε-Approximations of Terrains
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast LP-based Approximations for Geometric Packing and Covering Problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Faster approximation algorithms for geometric set cover
- Geometric approximation algorithms
- Improved approximation algorithms for geometric set cover
- Klee's measure problem made easy
- On the Complexity of Some Common Geometric Location Problems
- Parallel and robust empirical risk minimization via the median trick
- Parameterized algorithms
- Regret in the on-line decision problem
- The ellipsoid method and its consequences in combinatorial optimization
- The multiplicative weights update method: a meta-algorithm and applications
- The primal-dual method for approximation algorithms
This page was built for publication: Computing data distribution from query selectivities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902070)
