5164 search results - page 521 / 1033 » Consistency of the EKF-SLAM Algorithm |
206
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
195
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
198
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
201
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
290
Voted
GIS
2004
ACM
16 years 8 months ago
2004
ACM
The R*-tree is a state-of-the-art spatial index structure. It has already found its way into commercial systems. The most important improvement of the R*-tree over the original R-...