The existing Multi-View Learning (MVL) learns how to process patterns with multiple information sources. In generalization this MVL is proven to have a significant advantage over...
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...