Sciweavers

5864 search results - page 59 / 1173
» Can We Work around Numerical Methods
Sort
View
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 7 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
15 years 7 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
SADM
2008
178views more  SADM 2008»
15 years 3 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
111
Voted
ICRA
2005
IEEE
159views Robotics» more  ICRA 2005»
15 years 9 months ago
Learning Sensory Feedback to CPG with Policy Gradient for Biped Locomotion
— This paper proposes a learning framework for a CPG-based biped locomotion controller using a policy gradient method. Our goal in this study is to develop an efficient learning...
Takamitsu Matsubara, Jun Morimoto, Jun Nakanishi, ...
SIAMSC
2010
155views more  SIAMSC 2010»
14 years 10 months ago
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
Berkant Savas, Lek-Heng Lim