C R A I G   S I L V E R S T E I N
		
Department of Computer Science                       817 Santa Fe Ave
Stanford, CA  94305-9045                             Stanford, CA  94305
650 723-1787	                                     650 494-3680
http://www-cs-students.stanford.edu/~csilvers/       csilvers@cs.stanford.edu


ACADEMIC INTERESTS
     o Information retrieval and data mining.  For two summers at
       Xerox PARC, I have worked with Jan Pedersen and Hinrich
       Schuetze on efficient clustering of large data sets using
       Scatter/Gather.  As part of the advanced technology group at
       Verity, Inc., I modified the Verity search engine to support
       natural language queries.  I am also active in the Data Mining
       Research Group at Stanford.

     o Experimental Analysis of Algorithms.  I have worked with
       Andrew Goldberg on extensive analysis of practical
       implementations for Dijkstra's shortest path algorithm.
       This work has led to the development of new algorithms,
       including one which improves on the best known time
       bounds for this problem.  I am also analyzing
       perfect hashing algorithms.

ACADEMIC EXPERIENCE
     o Stanford University, Stanford, CA.  Candidate for degree of Ph.D. in
       Computer Science.  Focus in information retrieval and data mining
       under the supervision of Rajeev Motwani.

     o Harvard College, Cambridge, MA.  A.B. degree in Computer Science, with
       honors. June 1994.
          Phi Beta Kappa (1993), recipient of Microsoft Technical Scholarship
          (1993), twice recipient of Derek Bok Award for Teaching Excellence
          (1992, 1993), captain of first-place team in Association for
          Computing Machinery Annual International Programming Contest (1993).
       GPA: 14.33 (out of 15).  GPA in Computer Science: 14.75 (out of 15).

WORK EXPERIENCE
    o Consultant at Verity, Inc. in Sunnyvale, CA
          As part of the Advanced Technology Group, developed a new
          technique for processing natural language queries and
          modified the Verity search process to incorporate this new
          technology.
      Summer 1997 - present.

    o Researcher at Xerox PARC in Palo Alto, CA
          Worked with Jan Pedersen to develop almost-constant-time
          clustering algorithms for large data sets.  I developed
          a technique to merge this fast clustering with boolean
          search (patent pending).  I have also explored, with
          Hinrich Schuetze, the application of Latent Semantic
          Indexing to clustering.
      Summer 1995 - January 1997.

    o Software Design Engineer at Microsoft in Seattle, WA.
          In 1993, developed a segment of a communications interface for
          Microsoft's entry into the handheld computer market.  In 1992,
          conceived, designed, and programmed one segment -- a game -- of
          a multimedia project involving works of Igor Stravinski.
      Summer 1993, 1992.

TEACHING EXPERIENCE
     o Teaching Assistant at Stanford University in Advanced
       Algorithms (1998), Introduction to Computer Theory (1997),
       and Network Optimization (1996).
          Taught an hour-long section each week, graded problem sets,
          helped compose and grade problem sets and exams.
       Winter 1998, Autumn 1997, Winter 1996.

     o Teaching Fellow at Harvard University in Introduction to Computer
       Theory (1993) and Introduction to Programming (1992, 1991).
          Taught an hour-long section of 15-18 students a week.
          Graded problem sets, helped compose and grade exams, tutored
          on an individual basis. 
       Fall 1993, 1992, 1991.