Browse "School of Computing(전산학부)" by Title
Showing results 3201 to 3220 of 15987
| Computing a minimum-dilation spanning tree is NP-hard Cheong, Otfried; Haverkort, Herman; Lee, Mira, Computing: The Australasian Theory Symposium (CATS) 2007, pp.15 - 24, CATS '07, 2007-01-30 |
| Computing a minimum-dilation spanning tree is NP-hard = 최소-Dilation 신장 트리 찾기의 NP-hard 증명link Lee, Mi-Ra; 이미라; Cheong, Otfried; et al, 한국과학기술원, 2007 |
| Computing a single cell in the overlay of two simple polygons deBerg, M; Devillers, O; Dobrindt, K; Cheong, Otfried, INFORMATION PROCESSING LETTERS, v.63, no.4, pp.215 - 219, 1997-08 |
| Computing and combinatorics - Preface Chwa, Kyung Yong; Munro, J. Ian, THEORETICAL COMPUTER SCIENCE, v.363, no.1, pp.1 - 1, 2006-10 |
| Computing and verifying depth orders Berg, Mark de; Overmars, Mark; Cheong, Otfried, 8th Annual ACM Symposium on Computational Geometry (SoCG) 1992, pp.138 - 145, 1992-06-10 |
| COMPUTING AND VERIFYING DEPTH ORDERS DEBERG, M; OVERMARS, M; Cheong, Otfried, SIAM JOURNAL ON COMPUTING, v.23, no.2, pp.437 - 446, 1994-04 |
| Computing Betweenness Centrality in B-hypergraphs Lee, Kwang Hee; Kim, Myoung Ho, ACM Conference on Information and Knowledge Management (CIKM), pp.2147 - 2150, ACM Special Interest Group on Information Retrieval (SIGIR), 2017-11-08 |
| Computing Convolutions on Mesh-Like Structures Cheong, Otfried, The 7th International Parallel Processing Symposium, pp.695 - 699, 1993-04-13 |
| Computing direct shadows cast among disjoint convex polyhedra = 볼록 다면체로 구성된 광원과 물체간에 형성되는 그림자 영역의 경계선 계산link Jang, Jeong-Hwan; 장정환; et al, 한국과학기술원, 2011 |
| Computing direct shadows cast among disjoint convex polyhedra = 볼록 다면체로 구성된 광원과 물체간에 형성되는 그림자 영역의 경계선 계산link Jang, Jeong-Hwan; 장정환; et al, 한국과학기술원, 2011 |
| Computing distributional semantics of genes using graph = 그래프 구조를 활용한 유전자의 분포 의미 파악link Park, Jimin; Park, Jong C.; et al, 한국과학기술원, 2017 |
| Computing Farthest Neighbors on a Convex Polytope Cheong, Otfried; Shin, Chan-Su; Vigneron, Antoine, The 7th Annual International Computing and Combinatorics Conference 2001, pp.159 - 169, 2001-08-21 |
| Computing farthest neighbors on a convex polytope Cheong, Otfried; Shin, Chan-Su; Vigneron, Antoine, Lecture Notes in Computer Science, v.296, pp.159 - 169, 2001 |
| Computing haar integrals = 하 적분의 계산link Seon, Dongseong; Ziegler, Martin; et al, 한국과학기술원, 2019 |
| Computing Haar Measures Pauly, Arno; Ziegler, Martin A.; Seo, Dongseong, 28th International Conference on Computer Science Logic, European Association for Computer Science Logic, 2020-01-15 |
| Computing interdisciplinarity of scholarly objects using an author-citation-text model Seo, Min-Gwan; Jung, Seokwoo; Kim, Kyung-Min; Myaeng, Sung-Hyon, 5th Workshop on Bibliometric-Enhanced Information Retrieval, BIR 2017, pp.62 - 72, CEUR-WS, 2017-04-09 |
| Computing interdisciplinarity of scholarly objects using an author-citation-text model with a new measure = 저자.인용.텍스트 모델과 새로운 지수를 이용한 학술 개체의 융합도 측정link Seo, Min-Gwan; Myaeng, Sung-Hyon; et al, 한국과학기술원, 2017 |
| Computing Many Faces in Arrangements of Lines and Segments Agarwal, Pankaj; Matousek, Jiri; Cheong, Otfried, 10th Annual ACM Symposium on Computational Geometry (SoCG) 1994, pp.76 - 84, 1994-06-06 |
| Computing many faces in arrangements of lines and segments Agarwal, PK; Matousek, J; Cheong, Otfried, SIAM JOURNAL ON COMPUTING, v.27, no.2, pp.491 - 505, 1998-04 |
| Computing minimum-area rectilinear convex hull and L-shape Bae, Sang-Won; Lee, Chun-Seok; Ahn, Hee-Kap; Choi, Sung-Hee; Chwa, Kyung-Yong, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.42, no.9, pp.903 - 912, 2009 |
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