Jian Zhang - Publications

• Gaussian Process Learning for Cyber-Attack Early Warning,
  with Phil Porras and Johannes Ullrich,
  to appear in Proceedings of SIAM International Conference on Data Mining (SDM), 2008.

• Coclustering by Similarity Refinement,
  in Proceedings of the 6th International Conference on Machine Learning and Applications (ICMLA), 2007.

• A New Service for Increasing the Effectiveness of Network Address Blacklists,
  with Phil Porras and Johannes Ullrich
  in Proceedings of the 3rd Workshop on Steps to Reducing Unwanted Traffic on the Internet (SRUTI), 2007.

• Highly Predictive Blacklisting,
  with Phil Porras and Johannes Ullrich
  SRI Technical Report, 2007.

• Finding Highly Correlated Pairs Efficiently with Powerful Pruning,
  with Joan Feigenbaum,
  in Proceedings of ACM Conference on Information and Knowledge Management (CIKM), 2006, pp. 152-161.

• Learning-Based Anomaly Detection in BGP Updates,
  with Jennifer Rexford and Joan Feigenbaum,
  in Proceedings of SIGCOMM 2005 Workshop on Mining Network Data, 2005, pp. 219-220.
  A longer version is available as Yale University Technical Report YALEU/DCS/TR-1318.

• Graph Distances in the Streaming Model: The Value of Space,
  with Joan Feigenbaum, Sampath Kannan, Andrew McGregor and Siddharth Suri,
  in Proceedings of 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005, pp. 745-754

• Efficient Algorithms for Constructing (1+ε,β)-Spanners in the Distributed and Streaming Models,
  with Michael Elkin,
  in Distributed Computing 18(5):375-385, 2006
  A preliminary version appeared in Proceedings of 23th ACM Symposium on Principles of Distributed Computing (PODC), 2004, pp. 160-168
  

• On Graph Problems in a Semi-Streaming Model,
  with Joan Feigenbaum, Sampath Kannan, Andrew McGregor and Siddharth Suri,
  in Theoretical Computer Science 348 (2005), pp. 207-216. (Special issue of selected papers from ICALP'04.)
  A preliminary version appeared in Proceedings of 31th International Colloquium on Automata, Languages, and Programming (ICALP), LNCS Vol. 3142, 2004, pp. 531-543.

• Computing Diameter in the Streaming and Sliding-Window Models,
  with Joan Feigenbaum and Sampath Kannan,
  in Algorithmica 41(1):25-41, 2005
  

• Annotation and Computational Geometry in the Streaming Model,
  with Joan Feigenbaum and Sampath Kannan,
  Yale University Technical Report YALEU/DCS/TR-1249, 2003

• Gain Modulation of Recurrent Networks,
  with Laurence F Abbott, L.F,
  In Bower, J. ed. Computational Neuroscience, Trends in Research 2000 (Elsevier, Amsterdam) pp. 623-628. Also in Neurocomputing 32-33: 623-628 (2000).