scientific article; zbMATH DE number 5019895
From MaRDI portal
Publication:5290249
Recommendations
- scientific article; zbMATH DE number 2081015
- Geometric approximation algorithms
- Coresets for polytope distance
- Approximation algorithms for a geometric set cover problem
- Near-linear approximation algorithms for geometric hitting sets
- Near-linear approximation algorithms for geometric hitting sets
- On the approximate computation of the geometric difference of sets
- Approximate minimum enclosing balls in high dimensions using core-sets
- Approximations and optimal geometric divide-and-conquer
- Approximation of convex sets by polytopes
Cited in
(66)- Approximating largest convex hulls for imprecise points
- Practical methods for shape fitting and kinetic data structures using coresets
- Single facility collection depots location problem in the plane
- Aggregation error for location models: Survey and analysis
- High-dimensional approximate \(r\)-nets
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Approximation and complexity of the capacitated geometric median problem
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- An efficient sum query algorithm for distance-based locally dominating functions
- Window queries for intersecting objects, maximal points and approximations using coresets
- Approximate range searching: The absolute model
- A faster algorithm for truth discovery via range cover
- Streaming algorithms for extent problems in high dimensions
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Learning big (image) data via coresets for dictionaries
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Solving the chromatic cone clustering problem via minimum spanning sphere
- Core-sets: updated survey
- Linear-time approximation algorithms for unit disk graphs
- Simplified Planar Coresets for Data Streams
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II.
- Training Gaussian mixture models at scale via coresets
- Approximate polytope membership queries
- Network essence: PageRank completion and centrality-conforming Markov chains
- Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
- Automated scalable Bayesian inference via Hilbert coresets
- Data exploration by representative region selection: axioms and convergence
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Sparse Approximation via Generating Point Sets
- Subspace clustering through sub-clusters
- Sublinear algorithms for MAXCUT and correlation clustering
- Approximate convex hull of data streams
- Approximate convex intersection detection with applications to width and Minkowski sums
- On geometric prototype and applications
- Approximating Distance Measures for the Skyline
- Effective scenarios in multistage distributionally robust optimization with a focus on total variation distance
- Approximate range queries for clustering
- An efficient sum query algorithm for distance-based locally dominating functions
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- Minimal containment under homothetics: a simple cutting plane approach
- Approximating Largest Convex Hulls for Imprecise Points
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- Polytope approximation and the Mahler volume
- scientific article; zbMATH DE number 7053290 (Why is no real title available?)
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- Coresets for the Nearest-Neighbor Rule
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- On coresets for support vector machines
- Robust shape fitting via peeling and grating coresets
- Communication costs in a geometric communication network
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- Optimal experimental design: formulations and computations
- Efficient subspace approximation algorithms
- Clustering under perturbation stability in near-linear time
- Optimal volume-sensitive bounds for polytope approximation
- On the budgeted Hausdorff distance problem
- An empirical evaluation of k-means coresets
- Computing instance-optimal kernels in two dimensions
- Compressed empirical measures (in finite dimensions)
- Fast subspace approximation via greedy least-squares
- Dynamic coresets
- Small space representations for metric min-sum k-clustering and their applications
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 Q5290249)
