DSpace Community: KAIST School of ComputingKAIST School of Computinghttp://hdl.handle.net/10203/82020-11-18T14:54:48Z2020-11-18T14:54:48ZComputation of spatial skyline pointsBhattacharya, BinayBishnu, ArijitCheong, OtfriedDas, SandipKarmakar, ArindamSnoeyink, Jackhttp://hdl.handle.net/10203/2770802020-11-04T18:55:10Z2021-02-01T00:00:00ZTitle: Computation of spatial skyline points
Authors: Bhattacharya, Binay; Bishnu, Arijit; Cheong, Otfried; Das, Sandip; Karmakar, Arindam; Snoeyink, Jack
Abstract: The database skyline query (or non-domination query) has a spatial form: Given a setPwithnpoint sites, and a point set S of m locations of interest, a site p is an element of P is a skyline point if and only if for each q is an element of P\{p}, there exists at least one location s is an element of S that is closer topthan toq. We reduce the problem of determining skyline points to the problem of finding sites that have non-empty cells in an additively weighted Voronoi diagram under a convex distance function. The weights of said Voronoi diagram are derived from the coordinates of the sites ofP, while the convex distance function is derived from the set of locationsS. In the two-dimensional plane, this reduction gives an O((n + m) log(n + m))-time algorithm to find the skyline points.2021-02-01T00:00:00ZSmallest universal covers for families of trianglesPark, Ji-wonCheong, Otfriedhttp://hdl.handle.net/10203/2765272020-10-13T07:55:06Z2021-01-01T00:00:00ZTitle: Smallest universal covers for families of triangles
Authors: Park, Ji-won; Cheong, Otfried
Abstract: A universal cover for a family T of triangles is a convex set that contains a congruent copy of each triangle T is an element of T. We conjecture that for any family T of triangles of bounded diameter there is a triangle that forms a universal cover for T of smallest possible area. We prove this conjecture for all families of two triangles, and for the family of triangles that fit in the unit disk.2021-01-01T00:00:00ZVariational Interaction Information Maximization for Cross-domain DisentanglementHwang, HyeongjooKim, Geon-HyeongHong, SeunghoonKim, Kee-Eunghttp://hdl.handle.net/10203/2771972020-11-11T01:55:22Z2020-12-07T00:00:00ZTitle: Variational Interaction Information Maximization for Cross-domain Disentanglement
Authors: Hwang, Hyeongjoo; Kim, Geon-Hyeong; Hong, Seunghoon; Kim, Kee-Eung2020-12-07T00:00:00ZReducing DNN labelling cost using surprise adequacy: an industrial case study for autonomous drivingKim, JinhanJu, JeongilFeldt, RobertYoo, Shinhttp://hdl.handle.net/10203/2772162020-11-11T05:55:27Z2020-11-10T00:00:00ZTitle: Reducing DNN labelling cost using surprise adequacy: an industrial case study for autonomous driving
Authors: Kim, Jinhan; Ju, Jeongil; Feldt, Robert; Yoo, Shin2020-11-10T00:00:00Z