5115 search results - page 149 / 1023 » On Randomized Lanczos Algorithms |
149
click to vote
IPL
2007
15 years 6 months ago
2007
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...
171
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
166
click to vote
CC
2008
Springer
15 years 6 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
120
click to vote
JSYML
2011
15 years 1 months ago
2011
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functi...
186
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...