Coreset

Coreset

A coreset (in computational geometry) is a small subset of a point set that is used to compute a solution that approximates the solution that would be found if the entire point set were used.[1]

References

  1. ^ Pankaj K. Agarwal, Sariel Har-Peled, and Kasturti R. Varadarajan (2005-02-22) (PDF PS). Geometric Approximation via Coresets. http://valis.cs.uiuc.edu/~sariel/papers/04/survey/. Retrieved 2007-03-29. 

Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • K-means algorithm — The k means algorithm is an algorithm to cluster n objects based on attributes into k partitions, k < n. It is similar to the expectation maximization algorithm for mixtures of Gaussians in that they both attempt to find the centers of natural… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”