Browse "School of Computing(전산학부)" by Title
Showing results 5161 to 5180 of 15971
| Filtering XPath expressions for XML access control Jeon, JM; Chung, YD; Kim, Myoung Ho; Lee, Yoon Joon, COMPUTERS & SECURITY, v.23, no.7, pp.591 - 605, 2004 |
| Finding a Friendly Community in Social Networks Considering Bad Relationships Kim, Sang-Yeon; Choi, Dongwan; Chung, Chin-Wan, COMPUTER JOURNAL, v.58, no.6, pp.1469 - 1481, 2015-06 |
| Finding a Minimum Source Set in Directed Hypergraphs Kim, Hyun Jun; Lee, Kwang Hee; Kim, Myoung Ho, JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, v.33, no.2, pp.413 - 428, 2017-03 |
| Finding a Minimum Source Set in Directed Hypergraphs Kim, Hyun Jun; Lee, Kwang Hee; Kim, Myoung Ho, JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, v.33, no.2, pp.413 - 428, 2017-03 |
| Finding a minimum source set on directed hypergraphs = 유향 하이퍼그래프에서 최소 크기의 소스 집합 찾기link Kim, Hyunjun; 김현준; et al, 한국과학기술원, 2015 |
Finding a More Pleasant Compliance Illusion Method for a Hand-Held Device Han, Joyoung; Lee, Geehyuk, IEEE ACCESS, v.9, pp.168154 - 168161, 2021-12 |
| Finding a News Article Related to Posts in Social Media: The Need to Consider Emotion as a Feature Ko, ByungSoo; Park, Chanyong; Lee, Dongkeon; Kim, Jaewon; Choi, Ho-Jin; Han, Dongsoo, IEEE International Conference on Big Data and Smart Computing (BigComp), pp.662 - 665, IEEE, 2018-01 |
| Finding a plane subgraph with a certain property in ordered bipartite graphs = 순서화된 이분 그래프에서 평면 부 그래프를 찾는 문제들에 관한 연구link Son, Se-Chang; 손세창; et al, 한국과학기술원, 1990 |
| Finding a Related News Article of Posts in Social Media: The Need to Consider Emotion as a Feature Ko, ByungSoo; Park, Chan-Yong; Lee, DongKun; Kim, Jaewon; Choi, Ho-Jin; Han, Dongsoo, The 1st International Workshop on Dialog Systems (IWDS 2018), The 5th IEEE International Conference on Big Data and Smart Computing (BigComp2018), pp.662 - 665, IEEE, 2018-01-15 |
| Finding an efficient rewriting of OLAP queries using materialized views in data warehouses Park, Chang-Sup; Kim, Myoung Ho; Lee, Yoon Joon, DECISION SUPPORT SYSTEMS, v.32, no.4, pp.379 - 399, 2002-03 |
| 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 |
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