6358 search results - page 297 / 1272 » Computing spectral sequences |
173
click to vote
IROS
2006
IEEE
16 years 21 days ago
2006
IEEE
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
176
Voted
IJFCS
2006
15 years 6 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
183
click to vote
SCALESPACE
2005
Springer
16 years 5 days ago
2005
Springer
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...
194
click to vote
SSD
2005
Springer
16 years 5 days ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
177
click to vote
WOB
2003
15 years 8 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...