 | 2009 |
|---|
| 7 |       | Venkatesan Guruswami,
Ali Kemal Sinop:
Improved Inapproximability Results for Maximum k-Colorable Subgraph.
APPROX-RANDOM 2009: 163-176 |
| 6 | | Venkatesan Guruswami,
Ali Kemal Sinop:
Improved Inapproximability Results for Maximum k-Colorable Subgraph
CoRR abs/0910.2271: (2009) |
| 2008 |
|---|
| 5 | | Leo Grady,
Ali Kemal Sinop:
Fast approximate RandomWalker segmentation using eigenvector precomputation.
CVPR 2008 |
| 2007 |
|---|
| 4 | | Ali Kemal Sinop,
Leo Grady:
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm.
ICCV 2007: 1-8 |
| 3 | | Ali Kemal Sinop,
Leo Grady:
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method.
ICCV 2007: 1-8 |
| 2006 |
|---|
| 2 | | Ali Kemal Sinop,
Leo Grady:
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids.
MICCAI (2) 2006: 896-903 |
| 2004 |
|---|
| 1 | | Ediz Saykol,
Ali Kemal Sinop,
Ugur Güdükbay,
Özgür Ulusoy,
A. Enis Çetin:
Content-based retrieval of historical Ottoman documents stored as textual images.
IEEE Transactions on Image Processing 13(3): 314-325 (2004) |
