Masataka Konishi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Finding the nearest subspace is a fundamental problem and influential to many applications. In particular, a scal-able solution that is fast and accurate for a large problem has a great impact. The existing methods for the problem are, however, useless in a large-scale problem with a large number of subspaces and high dimensionality of the feature space. A(More)
  • 1