| 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 | 397 | 2007 |
| 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 | 186 | 2015 |
| Optimal column-based low-rank matrix reconstruction V Guruswami, AK Sinop Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 145 | 2012 |
| 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 | 132* | 2011 |
| Fast approximate random walker segmentation using eigenvector precomputation L Grady, AK Sinop 2008 IEEE Conference on Computer Vision and Pattern Recognition, 1-8, 2008 | 107* | 2008 |
| 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 | 88 | 2004 |
| Accurate banded graph cut segmentation of thin structures using laplacian pyramids AK Sinop, L Grady Medical Image Computing and Computer-Assisted Intervention–MICCAI 2006: 9th …, 2006 | 82* | 2006 |
| Exphormer: Sparse transformers for graphs H Shirzad, A Velingker, B Venkatachalam, DJ Sutherland, AK Sinop International Conference on Machine Learning, 31613-31632, 2023 | 38* | 2023 |
| Faster SDP hierarchy solvers for local rounding algorithms V Guruswami, AK Sinop FOCS 2012, 2012 | 30 | 2012 |
| 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 | 25* | 2007 |
| Approximating Non-Uniform Sparsest Cut via Generalized Spectra V Guruswami, AK Sinop SODA 2013 12, 2012 | 23 | 2012 |
| 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 | 18 | 2011 |
| Continuous-Valued MRF for Image Segmentation D Singaraju, L Grady, AK Sinop, R Vidal | 13 | 2011 |
| System and method for signal reconstruction from incomplete data AK Sinop, L Grady US Patent 8,335,955, 2012 | 12 | 2012 |
| Improved Inapproximability Results for Maximum k-Colorable Subgraph V Guruswami, AK Sinop International Workshop on Approximation Algorithms for Combinatorial …, 2009 | 12 | 2009 |
| Affinity-aware graph networks A Velingker, A Sinop, I Ktena, P Veličković, S Gollapudi Advances in Neural Information Processing Systems 36, 2024 | 11 | 2024 |
| How to round subspaces: A new spectral clustering algorithm AK Sinop Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 8 | 2016 |
| Constant factor lasserre integrality gaps for graph partitioning problems V Guruswami, AK Sinop, Y Zhou SIAM Journal on Optimization 24 (4), 1698-1717, 2014 | 8 | 2014 |
| Robust routing using electrical flows AK Sinop, L Fawcett, S Gollapudi, K Kollias ACM Transactions on Spatial Algorithms and Systems 9 (4), 1-25, 2023 | 7 | 2023 |
| 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 | 7 | 2016 |
Leo GradyJonaDirección de correo verificada de breyercapital.com
