Ali Kemal Sinop

发表

Content-based retrieval of historical Ottoman documents stored as textual images

Özgür Ulusoy, A. Enis Çetin, Ugur Güdükbay, 2004, IEEE Transactions on Image Processing.

Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems

Venkatesan Guruswami, Yuan Zhou, Ali Kemal Sinop, 2014, SIAM J. Optim..

Faster SDP Hierarchy Solvers for Local Rounding Algorithms

Venkatesan Guruswami, Ali Kemal Sinop, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives

Venkatesan Guruswami, Ali Kemal Sinop, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Uninitialized, globally optimal, graph-based rectilinear shape segmentation - the opposing metrics method

Leo Grady, Ali Kemal Sinop, A. Sinop, 2007, 2007 IEEE 11th International Conference on Computer Vision.

PHR: A Parallel Hierarchical Radiosity System with Dynamic Load Balancing

Ugur Güdükbay, Attila Gürsoy, Ali Kemal Sinop, 2005, The Journal of Supercomputing.

Spectral Embedding of k-Cliques, Graph Partitioning and k-Means

Ravishankar Krishnaswamy, Moses Charikar, Pranjal Awasthi, 2016, ITCS.

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives

Venkatesan Guruswami, Ali Kemal Sinop, 2011, Electron. Colloquium Comput. Complex..

Fast approximate Random Walker segmentation using eigenvector precomputation

Leo Grady, Ali Kemal Sinop, 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

Improved Inapproximability Results for Maximum k-Colorable Subgraph

Venkatesan Guruswami, Ali Kemal Sinop, 2013, Theory Comput..

Approximating Non-Uniform Sparsest Cut Via Generalized Spectra

Venkatesan Guruswami, Ali Kemal Sinop, 2013, SODA.

Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids

Leo Grady, Ali Kemal Sinop, A. Sinop, 2006, MICCAI.

Improved Inapproximability Results for Maximum k-Colorable Subgraph

Venkatesan Guruswami, Ali Kemal Sinop, 2009, APPROX-RANDOM.

The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number

Venkatesan Guruswami, Ali Kemal Sinop, 2011, SODA '11.

How to Round Subspaces: A New Spectral Clustering Algorithm

Ali Kemal Sinop, A. Sinop, 2015, SODA.

Optimal column-based low-rank matrix reconstruction

Venkatesan Guruswami, Ali Kemal Sinop, V. Guruswami, 2011, SODA.

A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm

Leo Grady, Ali Kemal Sinop, A. Sinop, 2007, 2007 IEEE 11th International Conference on Computer Vision.

The Hardness of Approximation of Euclidean k-Means

Ravishankar Krishnaswamy, Moses Charikar, Pranjal Awasthi, 2015, SoCG.

Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs pdf

Venkatesan Guruswami, Ali Kemal Sinop, 2013, ArXiv.

Towards a Better Approximation for Sparsest Cut?

Sanjeev Arora, Rong Ge, Ali Kemal Sinop, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra pdf

Venkatesan Guruswami, Ali Kemal Sinop, 2011, ArXiv.

Spectrally Robust Graph Isomorphism

Alexandra Kolla, Vivek Madan, Ioannis Koutis, 2018, ICALP.

Sketch-based Algorithms for Approximate Shortest Paths in Road Networks

Sreenivas Gollapudi, Ali Kemal Sinop, Gaurav Aggarwal, 2021, WWW.

Robust Routing Using Electrical Flows

Sreenivas Gollapudi, Kostas Kollias, Ali Kemal Sinop, 2021, SIGSPATIAL/GIS.

Weighted Stackelberg Algorithms for Road Traffic Optimization

Sreenivas Gollapudi, Kostas Kollias, Ali Kemal Sinop, 2021, SIGSPATIAL/GIS.

Improved Column-Based Low-Rank Matrix Reconstruction

Venkatesan Guruswami, Ali Kemal Sinop, 2011 .