5115 search results - page 599 / 1023 » On Randomized Lanczos Algorithms |
164
click to vote
STOC
1991
ACM
15 years 10 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
191
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
159
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Biological processes in cells are carried out by means of protein-protein interactions. Determining whether a pair of proteins interacts by wet-lab experiments is reso...
163
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
193
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...