The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...