I am presently having fun at Google.

I graduated in December 2007 with a Masters Degree in Computer Science from the University of Southern California. My research interests include algorithms, machine learning and mathematical optimization. I have been working with Professor David Kempe at University of Southern California in the field of graph clustering to develop approximate algorithms for clustering using Linear and Vector programming based optimization techniques .

I also worked with Professor Patrick Pantel (now at Yahoo! Research) at the University of Southern California's Information Sciences Institute on parallel implementations of a few NLP applications using Map Reduce methodology.

 

Contact(Obsolete)

Office: SAL 112

Office Phone: (213)-740-2292 

Email: gaurava at usc dot edu 

Resume

Resources

If you are looking for the source code for the LP and VP rounding programs used for detecting communities in the paper 'Modularity-Maximizing Network Communities via Mathematical Programming', you can get it here.

Research Papers 

          1. On Efficient Algorithms for the Number Partitioning Problem (with Dr. Dinesha K.V and  Dr. P.C.P Bhatt at IIIT- Bangalore)

          2. Modularity-Maximizing Network Communities via Mathematical Programming (with Dr. David Kempe, USC, LA) [download]
The University of Southern California does not screen or control the content on this website and thus does not guarantee the accuracy, integrity, or quality of such content. All content on this website is provided by and is the sole responsibility of the person from which such content originated, and such content does not necessarily reflect the opinions of the University administration or the Board of Trustees