1458 search results - page 70 / 292 » Monads for incremental computing |
109
click to vote
FCT
2001
Springer
15 years 4 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
106
click to vote
FGR
2006
IEEE
15 years 3 months ago
2006
IEEE
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
132
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
118
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Recently, a novel Log-Euclidean Riemannian metric [28] is proposed for statistics on symmetric positive definite (SPD) matrices. Under this metric, distances and Riemannian means ...
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
Visual tracking, in essence, deals with non-stationary data streams that change over time. While most existing algorithms are able to track objects well in controlled environments,...