725 search results - page 7 / 145 » Smoothed Analysis of Algorithms and Heuristics |
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
189
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
151
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
153
click to vote
FOCS
2009
IEEE
15 years 3 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
197
click to vote
AVI
2004
15 years 7 months ago
2004
There are several approaches for pen-based systems to improve legibility of handwritten text, e.g. smoothing the strokes composing the characters and words. A very challenging sol...