Browse "School of Computing(전산학부)" by Title
Showing results 8801 to 8820 of 15971
| Re-ranking model based on document clusters Lee, KS; Park, YC; Choi, Key-Sun, INFORMATION PROCESSING MANAGEMENT, v.37, no.1, pp.1 - 14, 2001-01 |
| Reachability by paths of bounded curvature in a convex polygon Ahn, Hee-Kap; Cheong, Otfried; Matousek, Jiri; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.45, no.1-2, pp.21 - 32, 2012-01 |
| Reachability by paths of bounded curvature in convex polygons Ahn, Hee-Kap; Cheong, Otfried; Matousek, Jiri; Vigneron, Antoine, ACM Symposium on Computational Geometry (SoCG) 2000, pp.251 - 259, 2000-06-14 |
| Reachability tree-based Task and Motion Planner using Abstract Action Plan Sampling 김강현; 박대형; 김민준, 한국로봇종합학술대회, 한국로봇학회, 2023-02-16 |
| Reachability Vectors: Features for Link-Based Similarity Measures Yoon, Seok-Ho; Kim, Ji-Soo; Ha, Jiwoon; Kim, Sang-Wook; Ryu, Minsoo; Choi, Ho-Jin, The 2014 Symposium on Applied Computing (SAC 2014), ACM Special Interest Group on Applied Computing (SIGAPP), 2014-03-24 |
| Reaching a Goal with Directional Uncertainty Berg, Mark de; Guibas, Leonidas; Halperin, Dan; Overmars, Mark; Cheong, Otfried; Sharir, Micha; Teillaud, Monique, 4th International Symposium on Algorithms and Computation, pp.1 - 10, 1993-12-15 |
| REACHING A GOAL WITH DIRECTIONAL UNCERTAINTY DEBERG, M; GUIBAS, L; HALPERIN, D; OVERMARS, M; Cheong, Otfried; SHARIR, M; TEILLAUD, M, THEORETICAL COMPUTER SCIENCE, v.140, no.2, pp.301 - 317, 1995-04 |
| Reaching a polygon with directional uncertainty Cheong, Otfried; Van Oostrum, R, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY APPLICATIONS, v.11, no.2, pp.197 - 214, 2001-04 |
| Reactive key management scheme for access control in group communications Kim, H; Lee, Y; Park, Y; Yoon, Hyunsoo, IEICE TRANSACTIONS ON COMMUNICATIONS, v.E90B, pp.982 - 986, 2007-04 |
| Reactive Task and Motion Planning under Temporal Logic Specifications Li, Shen; Park, Daehyung; Sung, Yoonchang; Shah, Julie A.; Roy, Nicholas, IEEE International Conference on Robotics and Automation (ICRA), pp.12618 - 12624, IEEE, 2021-05 |
| Reader-Writer Lock with Weighted Probablilities Priority for the Multithreaded Programming 강성일; 이흥규, 정보처리학회논문지A,B,C,D, v.5, no.11, pp.2997 - 3009, 1998-11 |
| Readersourcing an Accurate and Comprehensive Understanding of Health-related Information Represented by Media Ko, Eun-young; Liu, Ching; Cha, Hyuntak; Kim, Juho, 2019 CHI Conference on Human Factors in Computing Systems, CHI 2019, Association for Computing Machinery, 2019-05-05 |
| Reading Desk for Preschool Children and Older People with Emotional Speech Synthesis Lee, Ho-Joon; Lee, Yong-Jae; Park, Jong Cheol, International Conference on Convergence and Hybrid Information Technology (ICHIT), pp.740 - 747, Convergence and Hybrid Information Technology, 2011-09 |
| Reading urban placeness from instagram : (a) case study of gangbuk and gangnam = 인스타그램을 통한 장소성 분석 : 강북과 강남 지역을 중심으로link Yu, Minsang; Lee, Dongman; et al, 한국과학기술원, 2019 |
| REAL ANALYTIC MACHINES AND DEGREES: A TOPOLOGICAL VIEW ON ALGEBRAIC LIMITING COMPUTATION Gaertner, Tobias; Ziegler, Martin, LOGICAL METHODS IN COMPUTER SCIENCE, v.7, no.3, 2011 |
| Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra Ziegler, Martin, ANNALS OF PURE AND APPLIED LOGIC, v.163, no.8, pp.1108 - 1139, 2012-08 |
| Real computation: from computability via efficiency to practice = 실수연산의 계산 가능성, 효율, 실제사례link Hwang, Jiman; Martin, Ziegler; et al, 한국과학기술원, 2021 |
| Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation Meer, Klaus; Ziegler, Martin, FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, v.9, no.5, pp.599 - 609, 2009-10 |
| Real hypercomputation and continuity Ziegler, Martin, THEORY OF COMPUTING SYSTEMS, v.41, no.1, pp.177 - 206, 2007-07 |
| Real Rendering of Lips by Computer Graphics T. Agui; I. Nishii; T. Nagao; Oh, Yung-Hwan, JOURNAL OF THE JAPANESE SOCIETY OF PRINTING TECHNOLOGY, v.28, no.6, pp.456 - 464, 1991 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,745 2020 - 2024
- 5,391 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989