Differences
This shows you the differences between two versions of the page.
|
sml:news [2012/05/08 13:27] vishy |
sml:news [2012/06/28 04:39] (current) skirshne |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | * 06/22/2012: Sergey Kirshner, Jennifer Neville, and S. V. N. Vishwanathan organized a session on the [[http://learning.stat.purdue.edu/wiki/sml/statsymposium/networks/start|Statistical Issues with Modeling of Networks]] as part of the [[http://www.stat.purdue.edu/symp2012/|8th International Purdue Symposium on Statistics]]. | ||
| * 05/08/2012: Two papers from our group were accepted at KDD 2012 | * 05/08/2012: Two papers from our group were accepted at KDD 2012 | ||
| * Shin Matsushima, S. V. N. Vishwanathan, and Alex Smola, Linear Support Vector Machines via Dual Cached Loops. | * Shin Matsushima, S. V. N. Vishwanathan, and Alex Smola, Linear Support Vector Machines via Dual Cached Loops. | ||
| Line 25: | Line 26: | ||
| * [[http://webdocs.cs.ualberta.ca/~xinhua2/index.htm|Xinhua Zhang]], [[http://people.cs.uchicago.edu/~ankans/|Ankan Saha]], and [[http://www.stat.purdue.edu/~vishy|S. V. N. Vishwanathan]]. Lower Bounds on Rate of Convergence of Cutting Plane Methods. [[http://www.stat.purdue.edu/~vishy/papers/ZhaSahVis10.pdf|pdf]]. | * [[http://webdocs.cs.ualberta.ca/~xinhua2/index.htm|Xinhua Zhang]], [[http://people.cs.uchicago.edu/~ankans/|Ankan Saha]], and [[http://www.stat.purdue.edu/~vishy|S. V. N. Vishwanathan]]. Lower Bounds on Rate of Convergence of Cutting Plane Methods. [[http://www.stat.purdue.edu/~vishy/papers/ZhaSahVis10.pdf|pdf]]. | ||
| * Details about our NSF project on generating similar graphs efficiently can be found [[nsfgraphs:|here]]. | * Details about our NSF project on generating similar graphs efficiently can be found [[nsfgraphs:|here]]. | ||
| - | |||
