91 results on '"HYEON-SUK NA"'
Search Results
2. Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.
3. Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme.
4. Sensor redundancy check without geometric information.
5. Covering a Simple Polygon by Monotone Directions.
6. Constructing Optimal Highways.
7. Farthest-Polygon Voronoi Diagrams.
8. Querying approximate shortest paths in anisotropic regions.
9. Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.
10. Approximate shortest paths in anisotropic regions.
11. Generalizing the Kraft-McMillan Inequality to Restricted Languages.
12. The number of lines tangent to arbitrary convex polyhedra in 3D.
13. Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
14. Disjoint Unit Spheres admit at Most Two Line Transversals.
15. On the number of lines tangent to four convex polyhedra.
16. The probabilistic complexity of the Voronoi diagram of points on a polyhedron.
17. Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case.
18. The Aligned k-Center Problem.
19. Farthest-polygon Voronoi diagrams.
20. Guarding a Polygon from Two Nearly-Opposite Directions.
21. Querying Approximate Shortest Paths in Anisotropic Regions.
22. Covering a simple polygon by monotone directions.
23. Constructing Optimal Highways.
24. On the minimum total length of interval systems expressing all intervals, and range-restricted queries.
25. Escaping offline searchers and isoperimetric theorems.
26. Approximate Shortest Paths in Anisotropic Regions.
27. Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.
28. A note on maximally repeated sub-patterns of a point set.
29. Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.
30. Geometric permutations of disjoint unit spheres.
31. The Expected Number of 3D Visibility Events Is Linear.
32. On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes.
33. Voronoi diagrams on the spher.
34. Finding the maximum bounded intersection of k out of n halfplanes.
35. Blockchain-Based User-Participatory Game Update: Maze Escape Game Case
36. Automatic Multi-drone Path Planning using Network Flow Algorithms
37. Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.
38. On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes.
39. Farthest-Polygon Voronoi Diagrams
40. Computing k-Centers On a Line
41. PLANE SWEEP ALGORITHM FOR CIRCULAR ARCS
42. Making Levels More Challenging with a Cooperative Strategy of Ghosts in Pac-Man
43. Improving A Stealth Game Level Design Tool
44. Detection of Pavement Region with Structural Patterns through Adaptive Multi-Seed Region Growing
45. Detection of Pavement Borderline in Natural Scene using Radial Region Split for Visually Impaired Person
46. Detecting Abnormal Patterns of Network Traffic by Analyzing Linear Patterns and Intensity Features
47. THE ALIGNED K-CENTER PROBLEM
48. Covering a simple polygon by monotone directions
49. GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
50. Querying Approximate Shortest Paths in Anisotropic Regions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.