#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1981

2018

- This year (6)
- Last 5 years (16)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Method

Learn More

- Astrid Cruaud, Nina RÃ¸nsted, +26 authors Vincent Savolainen
- Systematic biology
- 2012

It is thought that speciation in phytophagous insects is often due to colonization of novel host plants, because radiations of plant and insect lineages are typically asynchronous. Recentâ€¦ (More)

We give new rounding schemes for the standard linear programming relaxation of the correlation clustering problem, achieving approximation factors almost matching the integrality gaps: For completeâ€¦ (More)

- Varun Kanade, Elchanan Mossel, Tselil Schramm
- IEEE Transactions on Information Theory
- 2014

The stochastic block model is a classical cluster exhibiting random graph model that has been widely studied in statistics, physics, and computer science. In its simplest form, the model is a randomâ€¦ (More)

- Prasad Raghavendra, Tselil Schramm
- APPROX-RANDOM
- 2014

In this work, we achieve gap amplification for the Small-Set Expansion problem. Specifically, we show that an instance of the Small-Set Expansion Problem with completeness Îµ and soundness 12 is atâ€¦ (More)

- Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer
- STOC
- 2016

We consider two problems that arise in machine learning applications: the problem of recovering a planted sparse vector in a random linear subspace and the problem of decomposing a random low-rankâ€¦ (More)

- Prasad Raghavendra, Satish Rao, Tselil Schramm
- STOC
- 2017

Random constraint satisfaction problems (CSPs) are known to exhibit threshold phenomena: given a uniformly random instance of a CSP with <i>n</i> variables and <i>m</i> clauses, there is a value ofâ€¦ (More)

- Prasad Raghavendra, Tselil Schramm
- ArXiv
- 2015

We give a lower bound of Î©Ìƒ( âˆš n) for the degree-4 Sum-of-Squares SDP relaxation for the planted clique problem. Specifically, we show that on an ErdÃ¶s-RÃ©nyi graph G(n, 1 2 ), with high probabilityâ€¦ (More)

- Tselil Schramm, David Steurer
- COLT
- 2017

We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS)â€¦ (More)

- Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer
- ArXiv
- 2015

We consider two problems that arise in machine learning applications: the problem of recovering aplanted sparse vector in a random linear subspace and theproblemofdecomposing a random low-rankâ€¦ (More)