Sciweavers

28 search results - page 4 / 6
» Approximate Joint Diagonalization Using a Natural Gradient A...
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 7 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
NIPS
2001
13 years 9 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
IMA
2007
Springer
97views Cryptology» more  IMA 2007»
14 years 1 months ago
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
Juan M. Estévez-Tapiador, John A. Clark, Ju...
JMLR
2010
108views more  JMLR 2010»
13 years 2 months ago
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation
The goal of sufficient dimension reduction in supervised learning is to find the lowdimensional subspace of input features that is `sufficient' for predicting output values. ...
Taiji Suzuki, Masashi Sugiyama
JMIV
2010
131views more  JMIV 2010»
13 years 6 months ago
An SL(2) Invariant Shape Median
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf