GiRyong Choi

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
Graph matching is an important problem in the field of computer vision. Graph matching problem can be represented as quadratic assignment problem. Because the problem is known to be NP-hard, optimal solution is hardly achievable so that a lot of algorithms are proposed to approximate it. Although there have been many studies about fast and accurate(More)
Due to the growing number of unlabeled documents, it is becoming important to develop unsupervised methods capable of automatically extracting information. Topic models and neural networks represent two such methods, and parameter approximation algorithms are typically employed to estimate the parameters because it is not possible precisely to compute the(More)
  • 1