5115 search results - page 126 / 1023 » On Randomized Lanczos Algorithms |
158
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
167
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
217
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
169
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
170
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...