Sciweavers

2239 search results - page 45 / 448
» Computing with abstract matrix structures
Sort
View
ICCV
2009
IEEE
16 years 4 months ago
Tensor completion for estimating missing values in visual data
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
PPAM
2007
Springer
15 years 5 months ago
New Data Structures for Matrices and Specialized Inner Kernels: Low Overhead for High Performance
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
José R. Herrero
IJCNN
2006
IEEE
15 years 5 months ago
On derivation of stagewise second-order backpropagation by invariant imbedding for multi-stage neural-network learning
— We present a simple, intuitive argument based on “invariant imbedding” in the spirit of dynamic programming to derive a stagewise second-order backpropagation (BP) algorith...
Eiji Mizutani, Stuart Dreyfus
IBPRIA
2007
Springer
15 years 6 months ago
Motion Segmentation from Feature Trajectories with Missing Data
Abstract. This paper presents a novel approach for motion segmentation from feature trajectories with missing data. It consists of two stages. In the first stage, missing data are...
Carme Julià, Angel Domingo Sappa, Felipe Lu...
ICANN
2005
Springer
15 years 5 months ago
Training of Support Vector Machines with Mahalanobis Kernels
Abstract. Radial basis function (RBF) kernels are widely used for support vector machines. But for model selection, we need to optimize the kernel parameter and the margin paramete...
Shigeo Abe