Planted clique - PDFSEARCH.IO - Document Search Engine

Planted clique
Results: 12

#	Item
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 Add to Reading List Source URL: sumofsquares.org - Date: 2016-11-17 19:44:26
2	CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-05 12:59:35 Graph theory Computational complexity theory Mathematics NP-complete problems Clique problem Planted clique Graph partition Graph coloring Clique Time complexity Maximal independent set Pathwidth
3	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 Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:36 Probability distributions Clique problem Expected value Planted clique Matrix Markov chain Normal distribution
4	CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-09-26 19:00:24 NP-complete problems Planted clique Clique problem Clique Graph partition Maximum cut Probability distribution
5	JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:36 Graph theory Computational complexity theory Mathematics NP-complete problems Dense subgraph Independent set Planted clique Clique Dense graph Hypergraph Graph coloring Subgraph isomorphism problem
6	JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Label optimal regret bounds for online local learning Pranjal Awasthi∗ PAWASHTI @ CS . PRINCETON . EDU Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 NP-complete problems Analysis of algorithms Clique problem Planted clique Time complexity Clique Matching Big O notation Matching polynomial Graph coloring
7	Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2013-03-20 23:48:10 NP-complete problems Clique problem Approximation algorithm Probability distributions Dominating set
8	On Finding Planted Cliques in Random Graphs GraphEx 2014 Lev Reyzin Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2014-08-21 16:10:28 Graph theory Mathematics Discrete mathematics Random graphs Clique Planted clique
9	On Finding Planted Cliques and Solving Random Linear Equa9ons Math Colloquium Lev Reyzin Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2014-08-21 22:39:36 Graph theory Random graphs Clique ErdsRnyi model
10	Sta$s$cal Algorithms and the Planted Clique Problem (and random graphs, linear equa$ons, & machine learning) Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2015-11-09 17:26:18 Graph theory Mathematics Discrete mathematics Random graphs Clique ErdsRnyi model