3038 search results - page 105 / 608 » High-Speed Function Approximation |
91
Voted
NPL
2008
15 years 2 months ago
2008
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
114
Voted
SIAMJO
2002
15 years 2 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
133
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
116
Voted
TKDE
2008
15 years 2 months ago
2008
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractica...
115
Voted
ICANN
2007
Springer
15 years 8 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...