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)
Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let mr(G) denote the minimum rank of all matrices in S(G), and mr + (G) the minimum rank of all positive semidefinite matrices in S(G). All graphs G with(More)
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)
  • Christina M Jarvis, Willett, M Kempton, Nancy M Targett
  • 2005
ACKNOWLEDGMENTS I would like to thank my advisor and committee chairperson, Dr. Willett Kempton, for his guidance and insight throughout my time in the Graduate College of Marine Studies, and for stimulating my interest in offshore wind energy. I would also like to thank my committee members, Dr. Madison University, for their invaluable input and for the(More)
  • 1