Streaming 1-Center with Outliers in High Dimensions

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Canadian Conference on Computational Geometry

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Streaming Algorithms for Extent Problems in High Dimensions

  2010cited by this paper
• Tight results for clustering and summarizing data streams

  2009cited by this paper
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions

  2008cited by this paper
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity

  2008cited by this paper
• A space-optimal data-stream algorithm for coresets in the plane

  2007cited by this paper
• Robust Shape Fitting via Peeling and Grating Coresets

  2006cited by this paper
• A Simple Streaming Algorithm for Minimum Enclosing Balls

  2006cited by this paper
• Approximating extent measures of points

  2004cited by this paper
• Faster core-set constructions and data stream algorithms in fixed dimensions

  2004cited by this paper
• Smaller core-sets for balls

  2003cited by this paper
• Shape fitting with outliers

  2003cited by this paper
• Algorithms for facility location problems with outliers

  2001cited by this paper
• Incremental clustering and dynamic information retrieval

  1997cited by this paper
• On linear-time deterministic algorithms for optimization problems in fixed dimension

  1996cited by this paper
• Approximating center points with iterated radon points

  1993cited by this paper
• Algorithms in Combinatorial Geometry

  1987cited by this paper

• Sublinear Time Algorithms for Several Geometric Optimization (With Outliers) Problems In Machine Learning

  2023cites this paper
• A local analysis to determine all optimal solutions of p-k-max location problems on networks

  2021cites this paper
• k-Center Clustering with Outliers in the Sliding-Window Model

  2021cites this paper
• Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning

  2021cites this paper
• A Sub-linear Time Framework for Geometric Optimization with Outliers in High Dimensions

  2020cites this paper
• Inline high-bandwidth network analysis using a robust stream clustering algorithm

  2019influential citation
• Exact algorithms for handling outliers in center location problems on networks using k-max functions

  2019cites this paper
• Minimum Enclosing Ball Revisited: Stability and Sub-linear Time Algorithms

  2019cites this paper
• A Novel Geometric Approach for Outlier Recognition in High Dimension

  2018cites this paper
• Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers

  2018cites this paper
• Small Space Stream Summary for Matroid Center

  2018cites this paper
• An Efficient Algorithm for Minimum Enclosing Ball with Outliers and Application

  2018cites this paper
• Solving Minimum Enclosing Ball with Outliers: Algorithm, Implementation, and Application

  2018cites this paper
• Location Problems with k-max Functions - Modelling and Analysing Outliers in Center Problems

  2018cites this paper
• Bi-criteria Approximation Algorithms for Minimum Enclosing Ball and $k$-Center Clustering with Outliers

  2018cites this paper
• A Streaming Algorithm for the Convex Hull

  2015cites this paper
• Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem

  2015cites this paper
• From approximate balls to approximate ellipses

  2013cites this paper
• Matroid and Knapsack Center Problems

  2013cites this paper
• Approximate minimum spanning ellipse in the streaming model

  2009cites this paper