Sciweavers

6045 search results - page 906 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
GRAPHICSINTERFACE
2003
15 years 8 months ago
CInDeR: Collision and Interference Detection in Real-time using graphics hardware
Collision detection is a vital task in almost all forms of computer animation and physical simulation. It is also one of the most computationally expensive, and therefore a freque...
Dave Knott, Dinesh K. Pai
ECCV
2010
Springer
15 years 7 months ago
Conjugate Gradient Bundle Adjustment
Abstract. Bundle adjustment for multi-view reconstruction is traditionally done using the Levenberg-Marquardt algorithm with a direct linear solver, which is computationally very e...
EOR
2006
65views more  EOR 2006»
15 years 6 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
TCS
2008
15 years 6 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun
COMPUTING
2004
115views more  COMPUTING 2004»
15 years 6 months ago
Length Preserving Multiresolution Editing of Curves
In this paper a method for multiresolution deformation of planar piecewise linear curves that preserves the curve length is presented. In a wavelet based multiresolution editing f...
Basile Sauvage, Stefanie Hahmann, Georges-Pierre B...