Sciweavers

3096 search results - page 13 / 620
» The Generalized FITC Approximation
Sort
View
COMPGEOM
2007
ACM
14 years 15 days ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
NN
2010
Springer
163views Neural Networks» more  NN 2010»
13 years 3 months ago
Approximating the stability region of a neural network with a general distribution of delays
We investigate the linear stability of a neural network with distributed delay, where the neurons are identical. We examine the stability of a symmetrical equilibrium point via th...
R. Jessop, S. A. Campbell
ICML
2004
IEEE
14 years 9 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
CDC
2010
IEEE
13 years 3 months ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 10 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz