|
Shuheng ZhouI am a postdoc in the Computer Science Department at CMU. My current research focuses on Statistical and Machine Learning theory and algorithms, especially in high-dimensional setting, and Privacy. I work closely with Professors John Lafferty and Larry Wasserman. I received my Ph.D. from CMU in August 2006; I was affiliated with the Parallel Data Lab, while my research was on theory.
email: my-login-id@cs.cmu.edu |
The wise find pleasure in water; the virtuous find pleasure in hills. The wise are active; the virtuous are tranquil. The wise are joyful; the virtuous are long-lived. -- The Analects, Confucius (551--479 BCE)
Time Varying Undirected Graphs
with John Lafferty and Larry Wasserman.
To appear in
The 21st Annual Conference on Learning Theory (COLT 2008),
Helsinki, Finland. July 2008.
arXiv:0802.2758/
conf version
Compressed Regression
with John Lafferty and Larry Wasserman.
Full version in submission to IEEE Transactions on Information Theory.
Shorter version in
The 21st Annual Conference on Neural Information Processing Systems (NIPS2007),
Vancouver, BC, Canada. December 2007.
arXiv:0706.0534/ conf version.
Learning Balanced Mixtures of Discrete Distributions with Small Sample
Shuheng Zhou, February 2008.
arXiv:0802.1244. In journal submission.
Separating Populations with Wide Data: a Spectral Analysis
with Avrim Blum, Amin Coja-Oghlan, and Alan Frieze.
The 18th International Symposium on Algorithms and Computation (ISAAC 2007),
Sendai, Japan. December 2007.
Abstract/ Postscript/ PDF/
Conf Version
A Rigorous Analysis of Population Stratification with Limited Data
with Kamalika Chaudhuri, Eran Halperin, and Satish Rao.
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2007,
New Orleans, Louisiana. January 2007.
Abstract / Postscript/ PDF
Edge Disjoint Paths in Moderately Connected Graphs
with Satish Rao.
Full Version. In submission to SIAM Journal of Computing, 2008.
Shorter version in
International Colloquium on Automata, Languages and Programming (ICALP 06),
Venice, Italy. July 2006.
Abstract/ Postscript/ PDF (conf)
On Hierarchical Routing in Doubling Metrics
with T-H. Hubert Chan, Anupam Gupta and Bruce M. Maggs.
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005,
Vancouver, BC, Canada. January 2005.
Abstract / Postscript [203K] / PDF [199K]
TR CMU-PDL-04-106 contains an updated version on routing, December 2004
Balancing Locality and Randomness in DHTs
Shuheng Zhou, Gregory R. Ganger, Peter Steenkiste.
Carnegie Mellon University
Technical Report CMU-CS-03-203, November 2003.
Abstract
/ Postscript [489K] /
PDF [511K]
Location-based
Node IDs: Enabling Explicit Locality in DHTs
Shuheng Zhou, Gregory R. Ganger, Peter Steenkiste.
Carnegie Mellon University
Technical Report CMU-CS-03-171, September 2003.
Abstract
/ Postscript [282K] /
PDF [160K]
Design and Evaluation of an Individually Simulated Mobility Model in Wireless Ad Hoc Networks
Tan, D.S., Zhou, S., Ho, J., Mehta, J.S., Tanabe, H.
Communication Networks and Distributed Systems Modeling and Simulation Conference 2002, San Antonio, TX.
[PDF]
Routing, Disjoint Paths, and Classification
Shuheng Zhou.
Carnegie Mellon University Ph.D. Dissertation CMU-PDL-06-109, August 2006.
(This contains results in my SODA05, ICALP06, SODA07 papers and
arXiv:0802.1244 preprint.)
Abstract/ Postscript [1.1M]/ PDF [971K]
@Copyright by Shuheng Zhou, 2000 - 2008, all rights reserved
