Sciweavers

6618 search results - page 1117 / 1324
» Natural Logic for Natural Language
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
16 years 7 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
CHI
2007
ACM
16 years 7 months ago
A study of out-of-turn interaction in menu-based, IVR, voicemail systems
We present the first user study of out-of-turn interaction in menu-based, interactive voice-response systems. Out-ofturn interaction is a technique which empowers the user (unable...
Saverio Perugini, Taylor J. Anderson, William F. M...
CHI
2006
ACM
16 years 7 months ago
Error correction of voicemail transcripts in SCANMail
Despite its widespread use, voicemail presents numerous usability challenges: People must listen to messages in their entirety, they cannot search by keywords, and audio files do ...
Moira Burke, Brian Amento, Philip L. Isenhour
ALT
2004
Springer
16 years 3 months ago
Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
Steffen Lange, Sandra Zilles
« Prev « First page 1117 / 1324 Last » Next »