Sciweavers

166 search results - page 7 / 34
» Learning Complexity vs. Communication Complexity
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 8 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
ROMAN
2007
IEEE
126views Robotics» more  ROMAN 2007»
14 years 1 months ago
Classes of Applications for Social Robots: A User Study
– The paper introduces an online user study on applications for social robots with 127 participants. The potential users proposed 570 application scenarios based on the appearanc...
Frank Hegel, Monja Lohse, Agnes Swadzba, Sven Wach...
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
FLAIRS
2001
13 years 9 months ago
User-Agent Interactions in Mixed-Initiative Learning
Mixed-initiative learning integrates complementary human and automated reasoning, taking advantage of their respective reasoning styles and computational strengths in order to sol...
Dorin Marcu, Mihai Boicu, Gheorghe Tecuci
AIIDE
2009
13 years 8 months ago
Evaluating the Authorial Leverage of Drama Management
A drama manager (DM) monitors an interactive experience, such as a computer game, and intervenes to shape the global experience so that it satisfies the author's expressive g...
Sherol Chen, Mark J. Nelson, Michael Mateas