Sciweavers

8669 search results - page 30 / 1734
» Computing matrix representations
Sort
View
PR
2011
12 years 10 months ago
A novel multi-view learning developed from single-view patterns
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...
Zhe Wang, Songcan Chen, Daqi Gao
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 2 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
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 ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
WMPI
2004
ACM
14 years 1 months ago
The Opie compiler from row-major source to Morton-ordered matrices
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...
Steven T. Gabriel, David S. Wise
ECCV
2006
Springer
14 years 9 months ago
Controlling Sparseness in Non-negative Tensor Factorization
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...
Matthias Heiler, Christoph Schnörr
JSC
2011
74views more  JSC 2011»
13 years 2 months ago
Constructive homomorphisms for classical groups
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...
Scott H. Murray, Colva M. Roney-Dougal