scientific article; zbMATH DE number 1528185
From MaRDI portal
Publication:4515159
algorithm designcircuit complexitycommunication complexitycomplexity theorycomputational geometrycomputer graphicsderandomizationdiscrepancy methodlinear programmingmachine learningMarkov chainsmathematical financeoptimizationprobabilistic algorithmspseudorandomnesssamplingsearchingtextbookVoronoi diagrams
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Linear programming (90C05) Numerical methods (including Monte Carlo methods) (91G60)
Recommendations
Cited in
(only showing first 100 items - show all)- Coloring geometric range spaces
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Small weak epsilon-nets
- Deterministic and probabilistic discrepancies
- Cubature formulas, discrepancy, and nonlinear approximation
- On simplifying dot maps.
- The Kadison-Singer problem in discrepancy theory.
- Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences
- A crossing lemma for Jordan curves
- Optimal jittered sampling for two points in the unit square
- The convexification effect of Minkowski summation
- Money creation process in a random redistribution model
- Optimal bounds for the predecessor problem and related problems
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- The structure and number of global roundings of a graph
- Typical rounding problems
- Lower bounds for intersection searching and fractional cascading in higher dimension
- Geometric characterization of Weyl's discrepancy norm in terms of its \(n\)-dimensional unit balls
- Uniformly inserting points on square grid
- Randomness of the square root of 2 and the giant leap. I
- Sampling scattered data with Bernstein polynomials: stochastic and deterministic error estimates
- On the largest empty axis-parallel box amidst \(n\) points
- Positive-definite functions, exponential sums and the greedy algorithm: a curious phenomenon
- Deterministic discrepancy minimization
- Lower bounds for matrix factorization
- Irregularities of distribution and geometry of planar convex sets
- Gaussian discrepancy: a probabilistic relaxation of vector balancing
- Upper and lower bounds for matrix discrepancy
- Optimal approximations made easy
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
- Powers of Hamilton cycles of high discrepancy are unavoidable
- Almost envy-freeness for groups: improved bounds via discrepancy theory
- Bisecting and \(D\)-secting families for set systems
- Quantum discrepancy: a non-commutative version of combinatorial discrepancy
- Improved distributed degree splitting and edge coloring
- Near-optimal coresets of kernel density estimates
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Four deviations suffice for rank 1 matrices
- Zero-sum subsequences in bounded-sum \(\{-r,s\}\)-sequences
- Zero-sum squares in bounded discrepancy \(\{-1,1\}\)-matrices
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples
- Approximate range searching: The absolute model
- Online uniformly inserting points on the sphere
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Dynamically defined sequences with small discrepancy
- Faster algorithms for growing prioritized disks and rectangles
- Poisson polyhedra in high dimensions
- Recent progress on combinatorics and algorithms for low discrepancy roundings
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- The power of online thinning in reducing discrepancy
- Toric algebra of hypergraphs
- Approximate range searching in higher dimension
- The Littlewood-Gowers problem
- A generalization of magic squares with applications to digital halftoning
- Non-independent randomized rounding and coloring
- Halton and Hammersley sequences in multivariate nonparametric regression
- Locally consistent constraint satisfaction problems
- Mean isoperimetry with control on outliers: exact and approximation algorithms
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives
- Octagonal symmetry in low-discrepancy -manganese
- Discrepancy of high-dimensional permutations
- Subsampling in smoothed range spaces
- Constructive Discrepancy Minimization for Convex Sets
- Online inserting points uniformly on the sphere
- Embedding graphs having Ore-degree at most five
- Inevitable randomness in discrete mathematics
- Constructive discrepancy minimization by walking on the edges
- Learning complexity vs communication complexity
- On the exponent of discrepancies
- Approximately uniform online checkpointing with bounded memory
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
- Computing generalized ham-sandwich cuts
- The Fourth Moment Method
- Piercing quasi-rectangles-on a problem of Danzer and Rogers
- Simplex Range Searching and Its Variants: A Review
- Tighter bounds for the discrepancy of boxes and polytopes
- A survey of average case complexity for linear multivariate problems
- The range of a simple random walk on \(\mathbb{Z}\): an elementary combinatorial approach
- An algorithm for Komlós conjecture matching Banaszczyk's bound
- Intersections of hypergraphs
- Tight lower bounds for the size of epsilon-nets
- The Communication Complexity of Distributed epsilon-Approximations
- A discrepancy version of the Hajnal-Szemerédi theorem
- Entropy samplers and strong generic lower bounds for space bounded learning
- Tverberg theorems over discrete sets of points
- Practical low-dimensional halfspace range space sampling
- Discrepancy in modular arithmetic progressions
- On splitting and splittable families
- A sharp discrepancy bound for jittered sampling
- Constructive discrepancy minimization with hereditary L2 guarantees
- Computing approximate statistical discrepancy
- Stabbing pairwise intersecting disks by five points
- Computing optimal \(\varepsilon\)-nets is as easy as finding an unhit set
- Lower bounds for matrix factorization
- Near-optimal coresets of kernel density estimates
- On the discrepancy of random matrices with many columns
- On the Wasserstein distance between classical sequences and the Lebesgue measure
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4515159)
