|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou |
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Optimal column-based low-rank matrix reconstruction. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Optimal Column-Based Low-Rank Matrix Reconstruction |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Improved Inapproximability Results for Maximum k-Colorable Subgraph. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Improved Inapproximability Results for Maximum k-Colorable Subgraph |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Improved Inapproximability Results for Maximum k-Colorable Subgraph. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo Grady, Ali Kemal Sinop |
Fast approximate RandomWalker segmentation using eigenvector precomputation. |
CVPR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Kemal Sinop, Leo Grady |
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm. |
ICCV |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Kemal Sinop, Leo Grady |
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method. |
ICCV |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Kemal Sinop, Leo Grady |
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids. |
MICCAI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Kemal Sinop, Tolga Abaci, Ümit Akkus, Attila Gürsoy, Ugur Güdükbay |
PHR: A Parallel Hierarchical Radiosity System with Dynamic Load Balancing. |
The Journal of Supercomputing |
2005 |
DBLP DOI BibTeX RDF |
|
| 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 |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")