Pages that link to "Item:Q2436653"

The following pages link to Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653):

Displayed 15 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) ‎ (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) ‎ (← links)
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) ‎ (← links)
• Recovery guarantees for exemplar-based clustering (Q897656) ‎ (← links)
• On semidefinite relaxations for the block model (Q1747735) ‎ (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) ‎ (← links)
• Convex relaxation methods for community detection (Q2038282) ‎ (← links)
• The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) ‎ (← links)
• On the hardness of designing public signals (Q2278949) ‎ (← links)
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes (Q2352734) ‎ (← links)
• Convexified modularity maximization for degree-corrected stochastic block models (Q2413602) ‎ (← links)
• Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation (Q4608088) ‎ (← links)
• Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) ‎ (← links)
• Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) ‎ (← links)
• \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) ‎ (← links)