6943 search results - page 787 / 1389 » Representations for evolutionary algorithms |
171
click to vote
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
208
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by ap...
188
click to vote
RSS
2007
15 years 8 months ago
2007
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
211
click to vote
AAAI
1993
15 years 8 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
213
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...