1539 search results - page 224 / 308 » Fast and Simple Methods For Computing Control Points |
MP
2010
13 years 7 months ago
2010
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
ISSAC
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
IDA
2005
Springer
14 years 2 months ago
2005
Springer
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
NIPS
1997
13 years 10 months ago
1997
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
Random projection has been suggested as a means of dimensionality reduction, where the original data are projected onto a subspace using a random matrix. It represents a computati...