Kyle Kloster Wrangling data, algorithms, and code in the SF Bay

Conferences

Conferences I’ve attended.

2019

  • ICIAM 2019, in Valencia, Spain.
    • presented talk on Centrality collisions, walk classes, and spider donuts, on joint work with Eric Horton and Blair D. Sullivan, in the minisymposium Networks, walks and matrix functions: new trends, results and potential issues

2017

  • Geometry of Redistricting: the Mathematics of Gerrymandering, at Duke University in Durham, NC.
  • ILAS Annual Meeting, in Ames, IA.
    • Co-presented talk on Condition Number of Krylov Matrices and Subspaces via Kronecker Product Structure on joint work with David Imberti in the minisymposium Solving matrix equations.
  • Moore Foundation Data-Driven Discovery Early Career Summit, in Waikoloa, HI.

2016

  • KDD Workshop on Mining Large Graphs, in San Francisco, CA.
  • SIAM NetSci, in Boston, MA.
  • ILAS Annual Meeting, in Leuven, Belgium.

2015

  • Workshop on Algorithms for the Web graph (WAW) 2015.
    • in the “WAW School on Complex Networks and Graph Models” – David Gleich and I co-presented a tutorial on Local diffusion algorithms for fast, personalized graph applications.
    • Presented talk on Strong Localization in Personalized PageRank on joint work with Huda Nassar and David F. Gleich.
  • SIAM Applications of Linear Algebra (SIAMLA) 2015.
    • Presented talk on “Local clustering with graph diffusions and spectral solution paths” on joint work with David F. Gleich.
  • Graph Exploitation Symposium (GraphEx) 2015 (Attended).
  • Gene Golub SIAM Summer School 2015 (G2S3) on Randomization in Numerical Linear Algebra
    • Accepted to program, awarded Student Travel Funding
    • Presented talk Sparse(r) Approximate Mat-vecs on joint work with David F. Gleich.

2014

  • Google KDD Day 2014
    • Invited to present poster Heat Kernel Based Community Detection on joint work with David F. Gleich.
  • Knowledge Discovery and Data mining (SIGKDD) 2014
    • Presented on Heat Kernel Based Community Detection, joint work with David F. Gleich.
    • NSF Student Travel Fund award recipient.
  • SIAM Netscience Workshop 2014 (Attended).
  • Massive Modern Data Sets (MMDS) 2014
    • presented poster Fast Relaxation Methods for Computing Functions of Matrices on joint work with David F. Gleich.
  • World Wide Web Consortium (WWW) 2014
    • presented poster Fast Parallel Max Clique Algorithms in place of authors Rossi, Gleich, Gebremedhin, and Patwary (not my work).

2013

  • Workshop for Algorithms from the Web Graph (WAW) 2013
    • paper accepted, Presented talk A Nearly Sublinear Approximation to exp{P}ei for Large Sparse Matrices from Social Networks on joint work with David F. Gleich.
    • Student Travel Fund recipient.
  • Gene Golub SIAM Summer School 2013 (G2S3) on Matrix Functions and Matrix Equations
    • Accepted to program, awarded Student Travel Funding
    • Presented talk A Quick and Dirty Approximation of exp{P}ei for Huge Networks on joint work with David F. Gleich.
  • SIAM SEAS Annual Meeting at Oak Ridge National Labs, 2013