5115 search results - page 155 / 1023 » On Randomized Lanczos Algorithms |
224
click to vote
MSWIM
2006
ACM
16 years 23 days ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
167
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Security in multiagent systems is commonly defined as the ability of the system to deal with intentional threats from other agents. This paper focuses on domains where such intent...
165
click to vote
CPC
2007
15 years 6 months ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
141
click to vote
JAIR
2007
15 years 6 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
178
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...