KCC2019 ¹ßÇ¥³í¹® Index

Index È®Àιæ¹ý

 <Oral¼¼¼Ç À妽º ¿¹½Ã> O1.7-08

 <Poster¼¼¼Ç À妽º ¿¹½Ã> P5.1-10

O1.7

-

08

P5

.1

-

10

¼¼¼Ç¸í

-

¹ßÇ¥¼ø¼­

¼¼¼Ç¸í

ºÐ¾ß

-

Æ÷½ºÅͺ¸µå¹øÈ£

* ¼¼ºÎÀå¼Ò ¹× ½Ã°£Àº Çà»çÀÏÁ¤Ç¥ ÂüÁ¶

°Ë»ö ³í¹® : 762 Æí
Á¢¼ö¹øÈ£ Á¦ ¸ñ ¹ßÇ¥ÀÚ Index
98 °í¼º´É SSD¸¦ À§ÇÑ MyRocks I/O ÆÐÅÏ ºÐ¼® ¹× ÃÖÀûÈ­ ±â¹ý ¼³°è ¸í±âÇö P4.1-07
980 CIDR: A Cost-Effective In-line Data Reduction System for Terabit-per-Second Scale SSD Arrays Mohammadamin Ajdari O5.3-01
981 Graphics-aware Power Governing for Mobile Devices ÃÖ¿ëÈÆ O3.2-01
982 Amoeba: An Autonomous Backup and Recovery SSD for Ransomware Attack Defense ¹Îµ¿Çö O2.2-01
983 Fast and Efficient Information Transmission with Burst Spikes in Deep Spiking Neural Networks ¹Ú¼º½Ä O3.2-02
984 TeksDB: Weaving Data Structures for a High-Performance Key-Value Store ÇÑÀ¯ÀÏ O1.7-01
985 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together ±¸°Ç¸ð O2.5-01
986 Training CNNs with Selective Allocation of Channels Á¤Á¾Çå O2.8-02
987 Self-Attention Graph Pooling ÀÌÁØÇö O2.8-01
988 FickleNet: Weakly and Semi-supervised Semantic Image Segmentation using Stochastic Inference ÀÌÁ¤¹ü O3.8-02
989 EMI: Exploration with Mutual Information ±èÇü¼® O1.6-01
99 µå·Ð ÁÖ¿ä ÄÄÆ÷³ÍÆ® ´ë»ó °ø°Ýº¤ÅÍ µµÃâ ¹× À§Çù ºÐ¼® ±è¼º°æ P3.4-09
990 Deep Metric Learning Beyond Binary Supervision ±è¼º¿¬ O3.8-01
991 Precise concolic unit testing of C programs using extended units and symbolic alarm filtering ±èÀ±È£ O2.6-01
992 MemFix: Static Analysis-Based Repair of Memory Deallocation Errors for C ÀÌÁØÈñ O1.1-02
993 Template-Guided Concolic Testing via Online Learning Â÷¼ö¿µ O1.1-03
994 Automatically generating search heuristics for concolic testing? Â÷¼ö¿µ O1.1-01
995 No, That¡¯s Not My Feedback: TV Show Recommendation Using Watchable Interval ÀÌ¿¬Ã¢ O3.7-03
996 RealGraph: A Graph Engine Leveraging the Power-Law Distribution of Real-World Graphs Àå¸íȯ O5.6-01
997 From Small-scale to Large-scale Text Classification ±è°­¹Î O3.7-02

/ 39 pages     List number


< BACK > < NEXT >   [ 38 page/ 39 pages ]

 [ÀÌÀü 10°³] [  31  32  33  34  35  36  37  38  39  ]