ScholarWorks@Soongsil University: Na, Hyeon-Suk

Detailed Information

Na, Hyeon-Suk (나현숙)

College of Information Technology (School of Computer Science and Engineering)

Research Area: 전산이론, 계산기하학, Theoretical Computer Science, Computational Geometry

Tel
Homepage

ResearcherID ORCiD Scopus Google Scholar ID ResearchGate

Keyword

Algorithm:4||computational geometry:3||Visualization Technique:2||Maximum flow:2||알고리즘:2||Ethereum:2||GPU:2||Intensity Feature:2||Computational Geometry:2||shortest path:2||Game level design(게임 레벨 디자인):2||방사형 영역 분할법:2||Network Traffic:2||Computational geometry:2||Abnormal Pattern:2||Parallel computing:2||visibility complex:2||블록체인:2||visual events:2||Blockchain:2||Flow network:2||(∏^1_2  BI)_0:2||계산기하학:2||Distributed ledgers:1||Event Detection:1||Facial Expression:1||Feature Point:1||Financial services:1||FirstPerson Shooter game(FPS 게임):1||Friedmanstyle miniaturization:1||Game Level Design(게임 레벨 디자인):1||Game simulation(게임 시뮬레이션).:1||Geometric facility location:1||Geometry Optimization:1||Guarding:1||Hadwigertype theorem:1||Hellytype theorem:1||Information System:1||Interval system:1||Isoperimetric theorem:1||Kruskal’s theorem:1||Lion and man problem:1||MPM algorithm:1||Majority vote scheme:1||Map generalization:1||Maximum intersection:1||Maze Escape Game:1||Minimum total length:1||Monotonicity:1||Network Coverage:1||Neural Network:1||Offline searcher:1||Pavement Region Detection:1||Plane sweep:1||Platforms:1||Polygon:1||Pushrelabel algorithm:1||Query:1||Radial Region Split:1||Radial region split:1||RamerDouglasPeucker algorithm:1||RamerDouglasPeucker 알고리즘:1||Reinforcement learning(강화학습):1||Robot regulation:1||Sensor Network:1||The kcenter problem:1||Unprovability:1||Unreliable sensor:1||Visually Impaired Person:1||Visually impaired person:1||Voronoi Diagram:1||Voronoi diagram:1||anisotropic regions:1||approximate algorithm:1||approximation:1||approximation algorithm:1||approximation algorithms:1||art gallery problem:1||axial symmetry:1||city metric:1||classification:1||convex distance function:1||convex distance functions:1||cops and robber:1||discrete geometry:1||expected complexity:1||formal proofs:1||geometric permutation:1||graph search:1||kCenter Problem:1||k센터:1||line transversal:1||minmaxmin problem:1||nominal approach:1||optimal highways:1||point sets:1||probabilistic analysis:1||pursuit and evasion:1||repeated configurations:1||safe path planning:1||selective omission:1||shape matching:1||threedimensional visibility:1||time metric:1||unit ball:1||unit sphere:1||variable binding:1||visibility:1||weighted region:1||경계선 검출:1||경찰과 도둑:1||그래프 탐색:1||기하최적화:1||네트워크 유지범위:1||네트워크 트래픽:1||노미널 방식:1||로봇 규제:1||명암 특징:1||미로탈출게임:1||법인:1||변수 묶기:1||보도 영역 검출:1||보로노이 다이어그램:1||분류법:1||분산 알고리즘:1||선택적 제거:1||센서 네트워크:1||시각 장애인:1||시각장애인:1||시각화 기법:1||신경망:1||안전 경로 계획:1||애니메이션 캐릭터:1||얼굴 표정:1||이더리움:1||이벤트 감지:1||이상 패턴:1||인공지능:1||적응적 다중 시드 영역 확장법:1||적응적 에지 검출:1||정보시스템:1||정형증명:1||증명 불가능성:1||지도일반화:1||추적과 침투:1||콕:1||크루스칼 정리:1||특징점:1||프리드먼 방식의 소형화:1||3D visibility:1||Adaptive MultiSeed Region Growing(AMSRG):1||Adaptive edge detection:1||Algorithms:1||Animation Character:1||Artificial Intelligence:1||Artificial Intelligence(인공지능):1||Artificial neural network(인공신경망):1||Behavior Pattern of NPC(NPC 행동 패턴):1||Blockchain technologies:1||Blockchains:1||Borderline detection:1||Boundary detection:1||Business:1||Collision detection algorithm(충돌 감지 알고리즘):1||Cooperative Multiagents(협력적 다중 에이전트):1||Coq:1||Corporatio:1||Decentralization:1||Decentralized applications:1||Distributed Algorithm:1||Distributed applications:1||

STATISTICS: Total View :7,948,587; Today View :2,932

RSS_1.0 RSS_2.0 ATOM_1.0

Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733

Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.

Detailed Information

Keyword

BROWSE