5115 search results - page 363 / 1023 » On Randomized Lanczos Algorithms |
175
Voted
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
197
Voted
ACMSE
2005
ACM
16 years 1 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
188
click to vote
SOFSEM
2001
Springer
15 years 12 months ago
2001
Springer
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
196
click to vote
EUROPAR
1997
Springer
15 years 11 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
182
Voted
TSP
2008
15 years 7 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...