4 search results - page 1 / 1 » Dynamic matrix rank with partial lookahead |
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
GECCO
2009
Springer
13 years 2 months ago
2009
Springer
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...