Sciweavers

8669 search results - page 93 / 1734
» Computing matrix representations
Sort
View
COLT
2007
Springer
14 years 3 months ago
Learning Permutations with Exponential Weights
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
David P. Helmbold, Manfred K. Warmuth
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 10 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 4 months ago
Asymptotic Moments for Interference Mitigation in Correlated Fading Channels
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
Jakob Hoydis, Mérouane Debbah, Mari Kobayas...
EUROPAR
2003
Springer
14 years 2 months ago
RECSY - A High Performance Library for Sylvester-Type Matrix Equations
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
Isak Jonsson, Bo Kågström
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 9 months ago
Efficient Matrix Completion with Gaussian Models
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
Flavien Léger, Guoshen Yu, Guillermo Sapiro