Browse "School of Computing(전산학부)" by Title
Showing results 5181 to 5200 of 16020
| Finding and diagnosing concurrency bugs in a kernel through systematic instruction scheduling = 체계적인 명령어 스케줄링을 통한 커널 동시성 버그 탐지 및 진단 기법link Jeong, Daelyong; Shin, Insik; et al, 한국과학기술원, 2023 |
| Finding Branch-Decompositions of Matroids, Hypergraphs, and More Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.35, no.4, pp.2544 - 2617, 2021-11 |
Finding epic moments in live content through deep learning on collective decisions Song, Hyeonho; Park, Kunwoo; Cha, Meeyoung, EPJ DATA SCIENCE, v.10, no.1, 2021-08 |
| Finding influential communities in networks with multiple influence types Seo, Junghyuk; Kim, Myoung Ho, INFORMATION SCIENCES, v.548, pp.254 - 274, 2021-02 |
| Finding influentials based on the temporal order of information adoption in Twitter Lee, Changhyun; Kwak, Haewoon; Park, Hosung; Moon, Sue Bok, 19th International World Wide Web Conference, WWW2010, pp.1137 - 1138, International World Wide Web Conference Committee, 2010-04-26 |
| Finding informative Q&As on twitter Kim, Kanghak; Lee, Sunho; Son, Jeonghoon; Cha, Meeyoung, 23rd International Conference on World Wide Web, WWW 2014, pp.319 - 320, International World Wide Web Conference Committee, 2014-04 |
| Finding k-Highest Betweenness Centrality Vertices in Graphs Chung, Chin-Wan; Lee, Min-joong, 23rd International Conference on World Wide Web, WWW 2014, pp.339 - 340, Association for Computing Machinery, Inc, 2014-04-09 |
| Finding Largest Common Point Sets Yon, J.; Cheng, S.-W.; Cheong, Otfried; Vigneron, A., International Journal of Computational Geometry and Applications, v.27, no.3, pp.177 - 185, 2017-09 |
| Finding largest rectangles in convex polygons Cabello, Sergio; Cheong, Otfried; Knauer, Christian; Schlipf, Lena, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.51, pp.67 - 74, 2016-01 |
| Finding Optimum Abstractions in Parametric Dataflow Analysis Zhang, Xin; Naik, Mayur; Yang, Hongseok, ACM SIGPLAN NOTICES, v.48, no.6, pp.365 - 376, 2013-06 |
| Finding Robust Domain from Attacks: a Learning Framework for Blind Watermarking Mun, Seung-Min; Nam, Seunghun; Jang, Han-Ul; Kim, Dongkyu; Lee, Heung-Kyu, NEUROCOMPUTING, v.337, no.1, pp.191 - 202, 2019-04 |
| Finding Shorter Addition/Subtraction-Chains Kweon, K; Hong, SM; Oh, S; Yoon, Hyunsoo, 3rd International Conference on Computing, Communications and Control Technologies (CCCT'05), pp.13 - 17, CCCT'05 (International Conference on Computing, Communications and Control Technologies), 2005-07-24 |
| FINDING THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME Shin, Sung-Yong; WOO, TC, PATTERN RECOGNITION, v.19, no.6, pp.453 - 458, 1986 |
| Finding the Critical Path in a Time-Constrained Workflow Son, J.H.; Kim, Myoung Ho, Seventh Int'l Conference on Real-Time Computing Systems and Applications (RTCSA 2000), pp.102 - 107, IEEE, 2000-12 |
| Finding the largest inscribed axially symmetric polygon for a convex polygon = 볼록다각형에서 최대의 내접 대칭 다각형 찾기link Choi, Chang-Yul; 최창렬; et al, 한국과학기술원, 2007 |
| Finding the M-best consistent correspondences between 3D symmetric objects Sung, Min-Hyuk; Kim, Junho, Computers & Graphics, v.37, no.1-2, pp.81 - 92, 2013-02 |
| FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting Woo, Kyoung Gu; Lee, Jeong Hoon; Kim, Myoung Ho; Lee, Yoon Joon, INFORMATION AND SOFTWARE TECHNOLOGY, v.46, no.4, pp.255 - 271, 2004-03 |
| Fine-grained fault tolerance for process variation-aware caches Mahmood T.; Kim, Soontae, IEEE Annual Symposium on VLSI, ISVLSI 2010, pp.46 - 51, 2010-07-05 |
| Fine-Grained Function Visibility for Multiple Dispatch with Multiple Inheritance Kim, Jieung; Ryu, Sukyoung; Luchangco, Victor; Steele Jr. , Guy L., Asian Symposium on Programming Languages and Systems, Asian Association for Foundation of Software, 2013-12-09 |
| Fine-Grained Socioeconomic Prediction from Satellite Images with Distributional Adjustment Ahn, Donghyun; Song, Minhyuk; Lee, Seungeon; Choi, Yubin; Kim, Jihee; Park, Sangyoon; Yang, Hyunjoo; et al, CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management, ACM, 2023-10-24 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,775 2020 - 2024
- 5,388 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989