5115 search results - page 421 / 1023 » On Randomized Lanczos Algorithms |
186
Voted
APPROX
2006
Springer
15 years 11 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
211
click to vote
DCOSS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
207
click to vote
SODA
2007
ACM
15 years 9 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
203
click to vote
DAGSTUHL
2004
15 years 9 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
303
click to vote
ESANN
2003
15 years 9 months ago
2003
Abstract. We study various ensemble methods for hybrid neural networks. The hybrid networks are composed of radial and projection units and are trained using a deterministic algori...