Browse "School of Computing(전산학부)" by Title
Showing results 8801 to 8820 of 15988
| RDF 데이타에 대한 효율적인 키워드 검색 기법 김진하; 송인철; 김명호, 정보과학회논문지 : 데이타베이스, v.35, no.6, pp.495 - 504, 2008-12 |
| RDF 온톨로지 데이터에 대한 효율적인 키워드 검색 = Efficient keyword searching on the RDF ontology datalink 김진하; Kim, Jin-ha; et al, 한국과학기술원, 2008 |
| RDF와 OWL 문서의 효율적 압축 = Efficient compression for RDF and OWL datalink 이기성; Lee, Ki-Sung; et al, 한국과학기술원, 2007 |
| RDMA as low-latency interconnect for scaled-out software router = 소프트웨어 라우터의 수평적 성능 확장을 위한 저지연 연결 기술로서의 RDMA에 대한 연구link Ma, Sangwook; 마상욱; et al, 한국과학기술원, 2016 |
| Re-engineering a credit card authorization system for maintainability and reusability of components - A case study Kang, KC; Lee, JJ; Kim, B; Kim, Moonzoo; Seo, CW; Yu, SL, REUSE OF OFF-THE-SHELF COMPONENTS, PROCEEDINGS BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.4039, pp.156 - 169, 2006 |
| Re-engineering a Credit Card Authorization System for Maintainability and Reusability of Components – a Case Study Kang, Kyo Chul; Lee, Jae Joon; Kim, Byungkil; Kim, Moonzoo; Seo, Chang-woo; Yu, Seung-lyeol, 2011-01-06 |
| Re-engineering Software Architecture of Home Service Robots: A Case Study Kim, Moonzoo; Lee, Jaejoon; Kang, Kyo Chul, ACM/IEEE International Conference on Software Engineering (ICSE), pp.505 - 513, ICSE, 2005-05-18 |
| Re-ranking algorithm using post-retrieval clustering for content-based image retrieval (vol 41, pg 177, 2005) Park, G; Baek, Y; Lee, Heung-Kyu, INFORMATION PROCESSING & MANAGEMENT, v.41, pp.411 - 411, 2005-03 |
| 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 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,746 2020 - 2024
- 5,391 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989