Ali Kemal Sinop
Contact Information
Carnegie Mellon University
Computer Science Department
5000 Forbes Avenue
Pittsburgh, PA 15213
Email: a...@cs.cmu.edu
Office
9015 Gates and Hillman Centers
Office phone: 412-268-1718
About Me
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:
- hardness of approximation,
- approximation algorithms,
- spectral graph theory.
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 .
Resume
Educational Background
Teaching
I was a teaching assistant for the following courses:
Recent Publications (2009-present)
-
Constant Factor Lasserre Gaps for Graph Partitioning Problems.
-
Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra.
-
Lasserre Hierarchy, Higher Eigenvalues, and
Approximation Schemes for Quadratic Integer
Programming with PSD Objectives.
-
Optimal Column-Based Low-Rank Matrix Reconstruction.
-
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number.
-
Improved inapproximability results for maximum k-colorable subgraph.
-
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing.
Not So Recent Publications
-
Fast Approximate Random Walker Segmentation Using Eigenvector Precomputation.
-
A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm.
-
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation - The Opposing Metrics Method.
-
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids.
Some Friends on the Web
Anshul Gandhi, Ravishankar Krishnaswamy,
Bodicherla Aditya Prakash, Dafna Shahaf,
Yuan Zhou