5115 search results - page 511 / 1023 » On Randomized Lanczos Algorithms |
198
Voted
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
212
Voted
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
179
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
219
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
267
Voted
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...