1186 search results - page 27 / 238 » Improving Random Walk Performance |
WIRN
2005
Springer
14 years 4 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
COMGEO
2000
ACM
13 years 10 months ago
2000
ACM
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
ICONIP
2010
13 years 9 months ago
2010
Abstract. Reservoir computing approaches have been successfully applied to a variety of tasks. An inherent problem of these approaches, is, however, their variation in performance ...
WIOPT
2006
IEEE
14 years 5 months ago
2006
IEEE
— This paper examines the achievable performance gains when a particular class of cooperative relaying known as best-select is employed. In essence, best-select seeks to improve ...
ICRA
2002
IEEE
14 years 3 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...