1![Proof, beliefs, and algorithms through the lens of sum-of-squares 1 An integrality gap for the planted clique problem The Planted Clique problem (sometimes referred to as the hidden clique Proof, beliefs, and algorithms through the lens of sum-of-squares 1 An integrality gap for the planted clique problem The Planted Clique problem (sometimes referred to as the hidden clique](https://www.pdfsearch.io/img/32987cdc671efbda0e896a37c8d170a4.jpg) | Add to Reading ListSource URL: sumofsquares.org- Date: 2016-11-17 19:44:26
|
---|
2![JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015 28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015 28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems](https://www.pdfsearch.io/img/90d5fe585a00bda3c76721046360bd0a.jpg) | Add to Reading ListSource URL: jmlr.orgLanguage: English - Date: 2015-07-20 20:08:36
|
---|
3![Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Yash Deshpande∗ and Andrea Montanari† February 28, 2015 Abstract Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Yash Deshpande∗ and Andrea Montanari† February 28, 2015 Abstract](https://www.pdfsearch.io/img/45f24586dfeb9f1d8f5b20bb4a474f76.jpg) | Add to Reading ListSource URL: web.stanford.eduLanguage: English - Date: 2015-04-23 23:13:32
|
---|
4![On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada](https://www.pdfsearch.io/img/fff57fdc22f9dc34210bd81b670028a4.jpg) | Add to Reading ListSource URL: www.mrfellows.netLanguage: English - Date: 2009-10-06 02:54:05
|
---|
5![ELSEVIER Information Processing Letters ELSEVIER Information Processing Letters](https://www.pdfsearch.io/img/57c1da13125504bf4030a106a52355d6.jpg) | Add to Reading ListSource URL: www.mrfellows.netLanguage: English - Date: 2009-08-06 03:07:31
|
---|
6![Image and Vision Computing–922 Contents lists available at ScienceDirect Image and Vision Computing journal homepage: www.elsevier.com/locate/imavis Image and Vision Computing–922 Contents lists available at ScienceDirect Image and Vision Computing journal homepage: www.elsevier.com/locate/imavis](https://www.pdfsearch.io/img/1952cdaccfcf6691b0de78655c51d21d.jpg) | Add to Reading ListSource URL: www.dsi.unive.itLanguage: English - Date: 2010-08-27 12:14:18
|
---|
7![Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗ Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗](https://www.pdfsearch.io/img/e2f295f249232e130a2360f0caed00e1.jpg) | Add to Reading ListSource URL: www.ii.uib.noLanguage: English - Date: 2013-10-25 09:59:52
|
---|
8![A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia.](https://www.pdfsearch.io/img/493c744f8de22680ab9f3103e32f8241.jpg) | Add to Reading ListSource URL: www.dsi.unive.itLanguage: English - Date: 2010-08-27 12:03:59
|
---|
9![New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory Samuel Rota Bul`o and Marcello Pelillo Dipartimento di Informatica, Universit` a Ca’ Foscari di Venezia, Venice, Italy {srotabul,pelillo}@ds New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory Samuel Rota Bul`o and Marcello Pelillo Dipartimento di Informatica, Universit` a Ca’ Foscari di Venezia, Venice, Italy {srotabul,pelillo}@ds](https://www.pdfsearch.io/img/fcce50110a499713ec95c4e1e6e40965.jpg) | Add to Reading ListSource URL: www.dsi.unive.itLanguage: English - Date: 2010-08-27 12:10:08
|
---|
10![You hereby find Figure 3 from your paper. I have problem with the clique consisting of threshold-9 players. For all other cliques in this example, it is the case that a player’s threshold is equal to the sum of numb You hereby find Figure 3 from your paper. I have problem with the clique consisting of threshold-9 players. For all other cliques in this example, it is the case that a player’s threshold is equal to the sum of numb](https://www.pdfsearch.io/img/6a60df117737572f90bd0c677e27d2a0.jpg) | Add to Reading ListSource URL: chwe.netLanguage: English - Date: 2012-05-24 15:22:00
|
---|