Sciweavers

1284 search results - page 14 / 257
» On Helping and Interactive Proof Systems
Sort
View
COCO
1994
Springer
102views Algorithms» more  COCO 1994»
13 years 11 months ago
Alternation in Interaction
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...
Marcos A. Kiwi, Carsten Lund, Alexander Russell, D...
HCI
2011
12 years 11 months ago
Modeling Pharmacokinetics and Pharmacodynamics on a Mobile Device to Help Caffeine Users
We introduce a mobile device application that displays key information about caffeine: the pharmacokinetics (time course of drug levels) and pharmacodynamics (the effects of caffei...
Frank E. Ritter, Kuo-Chuan (Martin) Yeh
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
14 years 1 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 1 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
IEAAIE
2005
Springer
14 years 1 months ago
A Semi-autonomous Wheelchair with HelpStar
This paper describes a semi-autonomous wheelchair enabled with “HelpStar” that provides a user who is visually impaired with mobility independence. Our “HelpStar” enabled s...
Hajime Uchiyama, Leonidas Deligiannidis, Walter D....