5115 search results - page 359 / 1023 » On Randomized Lanczos Algorithms |
192
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
210
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
188
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
179
click to vote
CDC
2009
IEEE
16 years 4 days ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
213
click to vote
SPAA
1994
ACM
15 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...