Friday, June 5, 2020

<< >>  
2020. 5
Sun Mon Tue Wed Thu Fri Sat
1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31
2020. 6
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30
2020. 7
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31
2020-06-12 / 16:00 ~ 18:00
학과 세미나/콜로퀴엄 - 확률론: 인쇄
by ()
In this final talk of the Graphon Seminar, we take a closer look at how graphons arise as the limit of convergent sequences of dense graphs. This talk is based on chapter 11 of the book "Large networks and graph limits" by Lászlo Lovász.
2020-06-12 / 16:00 ~ 18:00
학과 세미나/콜로퀴엄 - 확률론: 인쇄
by ()
In this final talk of the Graphon Seminar, we take a closer look at how graphons arise as the limit of convergent sequences of dense graphs. This talk is based on chapter 11 of the book "Large networks and graph limits" by Lászlo Lovász.
2020-06-05 / 16:00 ~ 18:00
학과 세미나/콜로퀴엄 - 확률론: 인쇄
by ()
In this penultimate talk of the Graphon Seminar, we investigate the method of sampling from a graph as a method of gathering information about very large, dense graphs. We will talk about this method in the context of graphons and introduce the concept of a W-random graph for a graphon W. This talk is based on chapter 10 of the book "Large networks and graph limits" by Lászlo Lovász.
2020-06-12 / 16:00 ~ 18:00
학과 세미나/콜로퀴엄 - 확률론: 인쇄
by ()
First talk: "Topics on graphons as limits of graph sequences I: Sampling" In this penultimate talk of the Graphon Seminar, we investigate the method of sampling from a graph as a method of gathering information about very large, dense graphs. We will talk about this method in the context of graphons and introduce the concept of a W-random graph for a graphon W. This talk is based on chapter 10 of the book "Large networks and graph limits" by Lászlo Lovász. Second talk: "Topics on graphons as limits of graph sequences II: Convergence of dense graph sequences" In this final talk of the Graphon Seminar, we take a closer look at how graphons arise as the limit of convergent sequences of dense graphs. This talk is based on chapter 11 of the book "Large networks and graph limits" by Lászlo Lovász.
2020-06-05 / 10:00 ~ 11:00
학과 세미나/콜로퀴엄 - 박사학위심사: 심층학습의 최적화 문제에 대한 설계 및 분석 인쇄
by 이철형(KAIST)
심사위원장 : 강 완 모, 심 사 위 원 : 황강욱, 김동환, 윤세영(AI대학원), 조경현(뉴욕대 전산학과)
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download