Mark Kempton

Learn More
We give a clustering algorithm for connection graphs, that is, weighted graphs in which each edge is associated with a d-dimensional rotation. The problem of interest is to identify subsets of small Cheeger ratio and which have a high level of consistency, i.e. that have small edge boundary and the rotations along any distinct paths joining two vertices are(More)
  • Hollie Irving, Elisabeth Pound, Changna Wang, Jie Xuan, Thomas Ence, Jon Low +39 others
  • 2009
The College's 23rd annual Spring Research Conference (SRC) was held from 8 a.m. to 2 p.m. on Saturday, March 21. The SRC gives students, both undergraduate and graduate, a chance to present the results of their research from the previous year. Each student participant had twelve minutes to present his or her research, with three minutes afterward to answer(More)
  • 1