-
Notifications
You must be signed in to change notification settings - Fork 0
/
r.html
executable file
·35 lines (35 loc) · 911 Bytes
/
r.html
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
<html>
<body>
<b>Recently Watched</b>
<ul>
<li>The Sting
<li>Hustler
<li>Charade
<li>How to Steal a Million
<li>Breakfast at Tiffany's
</ul>
<b>To See</b>
<ul>
<li>My Fair Lady
<li>Butch Cassidy
</ul>
<b>Problem 1: Differential Privacy</b>
<ul>
<li>Differential Privacy: Better Lower Bounds?
<li>If 2 query sets are answered with epsilon-DP, can we get lower bound on epsilon for the combined mechanism?
</ul>
<b>Problem 2: Diseconomies of Scale</b>
<ul>
<li>Any way of doing Racke but on a subtree?
<li>Racke with non-tree edges?
<li>Problem must involve alpha in APX ratio (from EDP)
<li>How does Chakrabarty et al. paper on Capacitated SNDP compare?
</ul>
<b>Problem 3: Regret Learning with Time-Varying Costs</b>
<ul>
<li>How does MW algorithm do? Follow the Leader?
<li>Metrical Tasks Paper (Avrim et al.)
<li>k-server with relaxed moving objective? k-server lower bounds (is OPT 0)?
</ul>
</body>
</html>