Dennis Kanygin

  • Citations Per Year
Learn More
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms we describe can be used to find the optimal partition of a set of data cells in any dimension. These algorithms work for any objective function that is strictly convex and(More)
  • 1