425 search results - page 49 / 85 » On the additive constant of the k-server Work Function Algor... |
120
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
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 ...
148
click to vote
COCO
2010
Springer
15 years 4 months ago
2010
Springer
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...
120
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
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 ...
159
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
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...
121
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
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...