-
Notifications
You must be signed in to change notification settings - Fork 0
/
schedule.yaml
86 lines (78 loc) · 2.76 KB
/
schedule.yaml
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
friday:
-
name: "Session 1"
time: "9:10-10:30"
talks:
- huynh22sweeping
- gardner22persistent
- agarwal22improved
- aronov22space
-
name: "Coffee Break and Discussion Time"
time: "10:30-11:00"
-
name: "Keynote: Radmila Sazdanovic"
time: "11:00-12:00"
title: "Data, Relations and Their Shape"
abstract: |
Topological Data Analysis provides tools for discovering relevant features of data by analyzing the shape of the point cloud. In this context we develop tools for visualizing maps between high dimensional spaces with the goal of discovering relations between data sets with expected correlations. Examples include analyzing relations between numerical and polynomial invariants for knots and graphs, and applications to cancer genomics and materials science.
-
name: Lunch (on your own)
time: 12:00-2:00
-
name: "Session 3"
time: "2:00-3:20"
talks:
- sheth22linear
- filtser22flipping
- sims22characterizing
- kurlin22geometric
-
name: "Coffee Break and Discussion Time"
time: "3:20-4:00"
-
name: Open Problems Session
chair: Don Sheehy
time: "4:00-5:30"
saturday:
-
name: "Session 5"
time: "9:10-10:30"
chair: Brittany Fasy
talks:
- ko22politics
- majhi22distance
- akitaya22complexity
- bhat22distance
-
name: "Coffee Break and Discussion Time"
time: "10:30-11:00"
-
name: "Keynote: Maarten Löffler"
time: "11:00-12:00"
title: "Labeled & Unlabeled Reconfiguration by Compaction"
abstract: |
We consider configurations of (labeled or unlabeled) objects on an integer lattice, and their behaviour under *compaction* operations: we may think of these as globally pushing all objects with a horizontal or vertical half-plane by one unit, where objects will also push other objects which are in the way. Under this model, the central question is: given two configurations of the same set of objects, is there a sequence of compaction operations that will transform the first configuration into the second. In this talk, we will consider both the characterization of such configuration pairs where the answer is yes, and the computational complexity of answering this question in general as well as in some special cases.
-
name: Lunch (boxed lunches provided)
time: 12:00-2:00
-
name: "Session 7"
time: "2:00-3:20"
chair: Hugo Akitaya
talks:
- hu22selectivity
- phillips22kernel
- dallant22conditional
- gao22obtaining
-
name: "Coffee Break and Discussion Time"
time: "3:20-4:00"
-
name: "Session 8"
time: "4:00-5:00"
chair: Carola Wenk
talks:
- zhang22best
- rocco22computing
- sereshgi22merging