What is SNRG?
SNRG is a reading group that holds weekly meetings to discuss interesting papers and problems, generally related to social networks. Feel free to attend meetings and participate in discussions. All ideas about problems, papers, talks, etc. are welcome. Meetings usually start with stating an interesting problem without getting into possible solutions, and then following up possible approaches to previously stated problems. An informal talk by a volunteer follows, and attendants discuss about the paper(s) as the speaker proceeds. Finally, possible applications of and extensions to the approach are discussed.
When, where, and how?
Currently, in the second Winter term of 2015/2016, meetings are held on Friday 2:00-3:30 pm in ICICS 104 .
You can also subscribe to our mailing list to get latest news and announcements. Please send an email to majordomo@cs.ubc.ca containing "subscribe sn-rg" in its body, and then follow the instructions.
SNRG talks
List of previous and upcoming talks:
| Date | Speaker | Title or Paper Name |
| Feb 12 | Sampoorna | Venkatesan T. Chakaravarthy et al., "Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results", PODS 2007. |
| Feb 19 | - | |
| Feb 26 | Prithu | Mohammad Mahdian et al., "Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs", STOC 2011. |
| March 4 | Prithu | (Continued from last week) |
| March 11 | Glenn | Yu Tang et al., "Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users?", SIGMOD 2016. |
| March 18 | Sharan | Nir Rosenfeld et al., "Discriminative Learning of Infection Models", WSDM 2016. |
| March 25 | ||
| April 1 | ||
| April 8 | Zheng | Andreas Krause et al., "Submodular Function Maximization", Chapter in Tractability: Practical Approaches to Hard Problems, Cambridge University Press, 2012. |
| April 15 | Ritika | Andreas Krause et al., "Submodular Function Maximization", Chapter in Tractability: Practical Approaches to Hard Problems, Cambridge University Press, 2012. |
| April 22 | Prithu | Jure Leskovec et al., "Cost-effective outbreak detection in networks", KDD 2007. |
| April 29 | Reza | Jan Vondrák, Optimal Approximation for the Submodular Welfare Problem in the Value Oracle Model, STOC 2008. |
| May 5 | Glenn | J. Lee, M. Sviridenko and J. Vondrák, "Submodular Maximization over Multiple Matroids via Generalized Exchange Properties", Journal Mathematics of Operations Research, Volume 35 Issue 4, November 2010. |
| May 13 | ||
| May 20 | ||
| May 27 | ||
| June 3 | Sampoorna | Daniel Golovin and Andreas Krause, "Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization", JAIR 2011. |
| June 10 | Sharan | Daniel Golovin and Andreas Krause, "Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization", JAIR 2011. |
| June 17 | Glenn | Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor and Roy Schwartz, "A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization", FOCS 2012 |
| June 24 | Prithu | Chandra Chekuri and Martin Pal, "A recursive greedy algorithm for walks in directed graphs", FOCS 2005. |
| July 1 | Ritika | David Kempe, Jon Kleinberg and Éva Tardos, "Maximizing the spread of influence through a social network", KDD 2003. |
| July 8 | Prithu | Prithu Banerjee, Pranali Yawalkar and Sayan Ranu, MANTRA: A Scalable Approach to Mining Temporally Anomalous Sub-trajectories", KDD 2016 |
| July 15 | Matthew Streeter and Daniel Golovin, "An Online Algorithm for Maximizing Submodular Functions", NIPS 2008. |