Sciweavers

903 search results - page 69 / 181
» On the reduction of a random basis
Sort
View
SAC
2010
ACM
16 years 1 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
NIPS
2001
15 years 7 months ago
Linking Motor Learning to Function Approximation: Learning in an Unlearnable Force Field
Reaching movements require the brain to generate motor commands that rely on an internal model of the task's dynamics. Here we consider the errors that subjects make early in...
O. Donchin, Reza Shadmehr
ICCV
2011
IEEE
14 years 6 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez
ICCS
2005
Springer
15 years 11 months ago
Bifurcation Analysis of Large Equilibrium Systems in Matlab
The Continuation of Invariant Subspaces (CIS) algorithm produces a smoothly varying basis for an invariant subspace R(s) of a parameter-dependent matrix A(s). In the case when A(s)...
David Bindel, James Demmel, Mark J. Friedman, Will...
SAC
2004
ACM
15 years 11 months ago
A back-end for GHC based on categorical multi-combinators
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
Ricardo Massa Ferreira Lima, Rafael Dueire Lins, A...