Seminars in September 2009

  • Sung-Soon Choi (최성순), Hypergraph Finding and Linkage Learning
    Hypergraph Finding and Linkage Learning
    Sung-Soon Choi (최성순)
    Department of Mathematics, Yonsei University, Seoul
    2009/9/25 Friday 3PM-4PM

    The graph finding problem is to find the edges of an unknown graph by using a certain type of queries. Its extension to hypergraphs is closely related to the problem of learning linkage in molecular biology and artificial intelligence. In this talk, we introduce the hypergraph finding problem and the linkage learning problem and present our recent results for the query complexity of those problems.

    Tags:

  • Hee-Kap Ahn (안희갑), The discrete Fréchet distance with imprecise input
    The discrete Fréchet distance with imprecise input
    Hee-Kap Ahn (안희갑)
    Department of Computer Science & Engineering, POSTECH, Pohang
    2009/9/11 Friday 4PM-5PM

    In shape matching, we are given two geometric objects and we compute their distance according to some geometric similarity measure. The Fréchet distance is a natural distance function for continuous shapes such as curves and surfaces, and is defined using reparameterizations of the shapes.

    The discrete Fréchet distance is a variant of the Fréchet distance in which we only consider vertices of polygonal curves. In this talk, we consider the problem of computing the discrete Fréchet distance between two polygonal curves when their vertices are imprecise, and describe efficient algorithms for the problem.

    Tags:

Monthly Archives