5115 search results - page 80 / 1023 » On Randomized Lanczos Algorithms |
102
click to vote
INCDM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
ICCS
2001
Springer
15 years 4 months ago
2001
Springer
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...