725 search results - page 7 / 145 » Smoothed Analysis of Algorithms and Heuristics |
CORR
2008
Springer
13 years 10 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...
DAGSTUHL
2007
13 years 11 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...
COCOON
2005
Springer
14 years 3 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 ...
FOCS
2009
IEEE
13 years 7 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...
AVI
2004
13 years 11 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...