Skip to main content

7 Result(s)

within Hyo-Sil Kim Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    TPCx-AI: First Adopter’s Experience Report

    This paper provides a report based on the first TPCx-AI benchmark publication.

    Hyo-Sil Kim, Doohwan Kim, Byoungjun Seo… in Performance Evaluation and Benchmarking (2023)

  2. No Access

    Article

    On the Number of Edges of Fan-Crossing Free Graphs

    A graph drawn in the plane with \(n\) n ...

    Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim in Algorithmica (2015)

  3. No Access

    Chapter and Conference Paper

    On the Number of Edges of Fan-Crossing Free Graphs

    A graph drawn in the plane with n vertices is fan-crossing free if there is no triple of edges e,f and g, such that e and f have a common endpoint and g crosses both e and f. We prove a tight bound of 4n − 9 on t...

    Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim in Algorithms and Computation (2013)

  4. No Access

    Chapter and Conference Paper

    Computing k-center over Streaming Data for Small k

    The Euclidean k-center problem is to compute k congruent balls covering a given set of points in ℝ d such that the radius is minimized. We consider the k-center problem in ℝ ...

    Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son in Algorithms and Computation (2012)

  5. No Access

    Chapter and Conference Paper

    The Cost of Bounded Curvature

    We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations σ,...

    Hyo-Sil Kim, Otfried Cheong in Computing and Combinatorics (2012)

  6. No Access

    Chapter and Conference Paper

    Measuring the Similarity of Geometric Graphs

    What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present ...

    Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura… in Experimental Algorithms (2009)

  7. No Access

    Chapter and Conference Paper

    Throwing Stones Inside Simple Polygons

    Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m logm) time a data structure that uses O(m) space and allows to answer the following query in O(logm) time: Gi...

    Otfried Cheong, Hazel Everett, Hyo-Sil Kim… in Algorithmic Aspects in Information and Man… (2006)