767 search results - page 26 / 154 » On Clustering Using Random Walks |
106
click to vote
ESANN
2007
15 years 3 months ago
2007
A novel approach to human motion recognition is proposed that is based on a variation of the Nonlinear Transient Computation Machine (NTCM). The motion data used to train the NTCM ...
123
click to vote
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
122
Voted
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
122
click to vote
TCS
2010
14 years 9 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
104
click to vote
JSAC
2007
15 years 2 months ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...