Browse by Title
Showing results 49601 to 49620 of 279498
| 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 adsorption properties of structurally deformed metal organic frameworks using a feature space map Jeong, Wooseok; Kim, Jihan; Lim, Dae-Woon; Kim, Sungjune; Harale, Aadesh; Yoon, Minyoung; Paik, Myunghyun, 253rd ACS National Meeting & Exposition, American Chemical Society (ACS), 2017-04-06 |
| 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 based on quantum principles Bae, Joonwoo, Particle Physics in Computing Frontiers, Institute of Basic Sciences (IBS), 2019-12-13 |
| 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 device and storage card Jung, Myoungsoo; Gouk, Donghyun; Kwon, Miryeong |
| Computing device for algorithm to reconstruct three-dimensional tomogram by considering multiple scattering, and method of the same Park, Yong Keun; Lee, Moosung; Herve Jerome Hugonnet |
| 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 for lazy life 노준용; 서형국; 김지환; 차승훈; 이성원; 유미, 2014-12-08 |
| Computing forward reachable sets for nonlinear adaptive multirotor controllers = 비선형 적응제어기가 결합된 멀티로터의 도달 가능 집합 계산link Han, Juyeop; Choi, Han-Lim; et al, 한국과학기술원, 2023 |
| Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications Dey, Tamal K.; Kim, Woojin; Mémoli, Facundo, 38th International Symposium on Computational Geometry, SoCG 2022, pp.34:1 - 34:17, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022-06-09 |
Discover
Type
Open Access
Date issued
- 34,330 2020 - 2024
- 100,102 2010 - 2019
- 75,680 2000 - 2009
- 44,727 1990 - 1999
- 14,360 1980 - 1989
- 62 1964 - 1969