Ali Kemal Sinop's homepage

Ali Kemal Sinop

Carnegie Mellon University
Computer Science Department
5000 Forbes Avenue
Pittsburgh, PA 15213
Email: a...@cs.cmu.edu

9015 Gates and Hillman Centers
Office phone: 412-268-1718

I am currently a fifth year PhD student in Computer Science, advised by Prof. Venkatesan Guruswami. From 2012 to 2014, I will be a postdoc at Institute for Advanced Study and Center for Computational Intractibility, Princeton University.

My research interests include:

Prior to coming to CMU, I worked at Siemens Corporate Research for two years under supervision of Dr. Leo Grady doing research on graph based algorithms for image segmentation. I received my M.S. degree from University of Pennsylvania in Philadelphia, Pennsylvania in Computer and Information Science and my B.S. from Bilkent University, Ankara, Turkey.

Last but not least, my hometown is Meram, Dere in city of Konya, Turkey .

PhD in Computer Science, Carnegie Mellon University, August 2007 - May 2012 (expected).
MS in Computer and Information Sciences, University of Pennsylvania, September 2004 - August 2005.
BS in Computer Engineering Bilkent University in Ankara Turkey, September 2000 - June 2004.

I was a teaching assistant for the following courses:

Constant Factor Lasserre Gaps for Graph Partitioning Problems.
- Manuscript arxiv, pdf.
- Joint work with Venkatesan Guruswami and Yuan Zhou.
Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra.
- Manuscript. arxiv, pdf.
- Joint work with Venkatesan Guruswami.
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives.
- FOCS 2011. Full version arXiv, PDF.
- FOCS Presentation PPS.
- Joint work with Venkatesan Guruswami.
Optimal Column-Based Low-Rank Matrix Reconstruction.
- SODA 2012. arXiv, PDF.
- SODA Presentation PPS.
- Joint work with Venkatesan Guruswami.
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number.
- SODA 2011, pdf.
- Joint work with Venkatesan Guruswami.
Improved inapproximability results for maximum k-colorable subgraph.
- APPROX 2009, arxiv, pdf.
- Joint work with Venkatesan Guruswami.
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing.
- Technical Report CMU, 2009, pdf.
- Joint work with Ioannis Koutis, Gary L. Miller, and David Tolliver .

Fast Approximate Random Walker Segmentation Using Eigenvector Precomputation.
- CVPR 2008, pdf.
- Joint work with Leo Grady .
A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm.
- ICCV 2007, pdf.
- Joint work with Leo Grady .
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation - The Opposing Metrics Method.
- ICCV 2007, pdf.
- Joint work with Leo Grady .
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids.
- MICCAI 2006, pdf.
- Joint work with Leo Grady .