Smoothed analysis is a way of measuring the complexity of an algorithm. It gives a more realistic analysis of the practical performance of theâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

Low rank decomposition of tensors is a powerful tool for learning generative models. The uniqueness results that hold for tensorsâ€¦Â (More)

Is this relevant?

2011

2011

- David Arthur, Bodo Manthey, Heiko RÃ¶glin
- J. ACM
- 2011

The <i>k</i>-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practiceâ€¦Â (More)

Is this relevant?

2011

2011

- Bodo Manthey, Heiko RÃ¶glin
- it - Information Technology
- 2011

Many algorithms perform very well in practice, but have a poor worst-case performance. The reason for this discrepancy is thatâ€¦Â (More)

Is this relevant?

2009

2009

- Bodo Manthey, Heiko RÃ¶glin
- SODA
- 2009

The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worstâ€¦Â (More)

Is this relevant?

2007

2007

- Siddhartha Chaudhuri, Vladlen Koltun
- ANALCO
- 2007

The probabilistic roadmap algorithm is a leading heuristic for robot motion planning. It is extremely efficient in practice, yetâ€¦Â (More)

Is this relevant?

2007

2007

- Bodo Mantheya, RÃ¼diger Reischukb
- 2007

Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worstâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Xi Chen, Xiaotie Deng, Shang-Hua Teng
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

The authors advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving twoâ€¦Â (More)

Is this relevant?

2006

2006

Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper weâ€¦Â (More)

Is this relevant?

2005

2005

- Heiko RÃ¶glin, Berthold VÃ¶cking
- IPCO
- 2005

We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothedâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Daniel A. Spielman, Shang-Hua Teng
- STOC
- 2001

We introduce the <italic>smoothed analysis of algorithms</italic>, which is a hybrid of the worst-case and average-case analysisâ€¦Â (More)

Is this relevant?