Ali Kemal Sinop
Ali Kemal Sinop
Verified email at nu.edu.kz
Title
Cited by
Cited by
Year
A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm
AK Sinop, L Grady
2007 IEEE 11th International Conference on Computer Vision, 1-8, 2007
3582007
Markov random fields for vision and image processing
A Blake, P Kohli, C Rother
Mit Press, 2011
2982011
The Hardness of Approximation of Euclidean k-means
P Awasthi, M Charikar, R Krishnaswamy, AK Sinop
31st International Symposium on Computational Geometry (SOCG 2015), 2015
1212015
Optimal column-based low-rank matrix reconstruction
V Guruswami, AK Sinop
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1122012
Fast approximate random walker segmentation using eigenvector precomputation
L Grady, AK Sinop
2008 IEEE Conference on Computer Vision and Pattern Recognition, 1-8, 2008
101*2008
Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with PSD objectives
V Guruswami, AK Sinop
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 482-491, 2011
98*2011
Content-based retrieval of historical Ottoman documents stored as textual images
E Saykol, AK Sinop, U Gudukbay, O Ulusoy, AE Çetin
Image Processing, IEEE Transactions on 13 (3), 314-325, 2004
802004
Accurate banded graph cut segmentation of thin structures using laplacian pyramids
AK Sinop, L Grady
International Conference on Medical Image Computing and Computer-Assisted …, 2006
72*2006
Faster SDP hierarchy solvers for local rounding algorithms
V Guruswami, AK Sinop
FOCS 2012, 2012
232012
Uninitialized, globally optimal, graph-based rectilinear shape segmentation-the opposing metrics method
AK Sinop, L Grady
2007 IEEE 11th International Conference on Computer Vision, 1-8, 2007
21*2007
Approximating Non-Uniform Sparsest Cut via Generalized Spectra
V Guruswami, AK Sinop
SODA 2013 12, 2012
202012
The complexity of finding independent sets in bounded degree (hyper) graphs of low chromatic number
V Guruswami, AK Sinop
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
162011
System and method for signal reconstruction from incomplete data
AK Sinop, L Grady
US Patent 8,335,955, 2012
122012
Improved Inapproximability Results for Maximum k-Colorable Subgraph
V Guruswami, AK Sinop
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
122009
Continuous valued MRFs for image segmentation
D Singaraju, L Grady, AK Sinop, R Vidal
Advances in Markov Random Fields for Vision and Image Processing, 2010
112010
Spectral embedding of k-cliques, graph partitioning and k-means
P Awasthi, M Charikar, R Krishnaswamy, AK Sinop
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
82016
Constant factor lasserre integrality gaps for graph partitioning problems
V Guruswami, AK Sinop, Y Zhou
SIAM Journal on Optimization 24 (4), 1698-1717, 2014
82014
How to round subspaces: A new spectral clustering algorithm
AK Sinop
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
62016
Towards a better approximation for sparsest cut?
S Arora, R Ge, AK Sinop
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 270-279, 2013
62013
Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs
V Guruswami, AK Sinop
arXiv preprint arXiv:1312.3024, 2013
52013
The system can't perform the operation now. Try again later.
Articles 1–20