1054 search results - page 115 / 211 » Fast Approximated SIFT |
125
click to vote
ARCS
2006
Springer
15 years 8 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
130
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present a novel algorithm for approximating the parameters of a multivariate t-distribution. At the expense of a slightly decreased accuracy in the estimates, the prop...
150
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
127
click to vote
NIPS
2003
15 years 5 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
125
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method. We als...