137 search results - page 7 / 28 » Revisiting stochastic loss networks: structures and algorith... |
TNN
1998
14 years 9 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
AAIM
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
ASMTA
2008
Springer
14 years 11 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
107
click to vote
PAMI
2010
14 years 4 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...