Linear spaces of n× n× n tensors over finite fields are investigated where the rank of every nonzero tensor in the space is bounded from below by a prescribed number μ. Such linear paces can recover any n × n × n error tensor of rank ≤ (μ−1)/2, and, as such, they can be used to correct three-way crisscross errors. Bounds on the dimensions of such spaces are given for μ ≤ 2n+1, and constructions...

We present a computational framework capable of labeling the effort of an action corresponding to the perceived level of exertion by the performer (low – high). The approach initially factorizes examples (at different efforts) of an action into its three-mode principal components to reduce the dimensionality. Then a learning phase is introduced to compute expressive-feature weights to adjust th...

Web-based learning programs enable learners to browse web pages individually through a predefined path or a personalized routine. However, they provide less social context and cooperative context for cooperation. The main idea presented in this poster is the concept of “informal cooperative learning program”. It is defined as a set of structured learning steps. Learners can go through all steps...