Browse "CS-Journal Papers(저널논문)" by Title
Showing results 1401 to 1420 of 4026
| Feature-Sensitive Coverage for Conformance Testing of Programming Language Implementations Park, Jihyeok; Youn, Dongjun; Lee, Kanguk; Ryu, Sukyoung, PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, v.7, no.PLDI, 2023-06 |
| Feedforward Neural Network Architectures for Complex Classification Problems Cho, SB; Kim, JinHyung, FUZZY SYSTEMS AND ARTIFICIAL INTELLIGENCE, v.3, no.0, pp.113 - 128, 1993-01 |
| FeelRing : 웨어러블 컴퓨터를 위한 반지형 포인팅 장치의 디자인 및 평가 이기혁; 표세영; 김호진, 한국차세대컴퓨팅학회 논문지, v.2, no.4, pp.5 - 13, 2006-12 |
| Filter Data Cache: An Energy-Efficient Small L0 Data Cache Architecture Driven by Miss Cost Reduction Lee, Jongmin; Kim, Soon-Tae, IEEE TRANSACTIONS ON COMPUTERS, v.64, no.7, pp.1927 - 1939, 2015-07 |
| Filtering false alarms of buffer overflow analysis using SMT solvers Kim, Youil; Lee, Jooyong; Han, Hwansoo; Choe, Kwang-Moo, INFORMATION AND SOFTWARE TECHNOLOGY, v.52, no.2, pp.210 - 219, 2010-02 |
| 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 More Pleasant Compliance Illusion Method for a Hand-Held Device Han, Joyoung; Lee, Geehyuk, IEEE ACCESS, v.9, pp.168154 - 168161, 2021-12 |
| 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 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 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 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 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 |
Discover
Open Access
- 187 OA Article