Approximation Algorithms for the Class Cover Problem

By Adam Cannon, Lenore J. Cowen. 2004

59 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Mineichi Kudo
2. Ichigaku Takigawa
3. John C. Wierman
4. Jason G. DeVinney
5. Atsuyoshi Nakamura

In Computer Graphics and Computer-Aided Design

1. Mineichi Kudo
2. Ichigaku Takigawa
3. John C. Wierman
4. Jason G. DeVinney
5. Atsuyoshi Nakamura

In Computer Networks and Communications

1. Mineichi Kudo
2. Ichigaku Takigawa
3. John C. Wierman
4. Jason G. DeVinney
5. Atsuyoshi Nakamura

Citations in the corpus

• Convex sets as prototypes for classifying patterns (2009, methodology): “, 2002), ball-based combinatorial classifier (Cannon et al., 2002; Cannon and Cowen, 2004; Priebe et al., 2003; Marchette, 2004; DeVinney, 2003), conventional prototype-based methods such as nearest neighbors and learning vector quantization (Hastie et al.”
• A SLLN for a one-dimensional class cover problem (2002, methodology): “The CCP was introduced by Cannon and Cowen [CC00].”