1401 search results - page 37 / 281 » Randomness in Interactive Proofs |
129
click to vote
FLAIRS
2006
15 years 4 months ago
2006
In building intelligent tutoring systems, it is critical to be able to understand and diagnose student responses in interactive problem solving. We present a novel application of ...
127
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriï...
116
click to vote
SSS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
144
Voted
CADE
2005
Springer
16 years 3 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
211
click to vote
COGSYS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...