Sciweavers

5722 search results - page 529 / 1145
» Security Function Interactions
Sort
View
FOCS
2002
IEEE
15 years 10 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
CHI
1994
ACM
15 years 9 months ago
A survey on user expectations for interface builders
This study provides many insights into the features that users look for in interface building tools, as well as those that can hinder their use. The results suggest that users are...
Michel Desmarais, Cameron Hayne, Sumithra Jagannat...
161
Voted
DCOSS
2006
Springer
15 years 8 months ago
When Birds Die: Making Population Protocols Fault-Tolerant
In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
147
Voted
CHI
1995
ACM
15 years 8 months ago
Oh what a tangled web we weave: metaphor and mapping in graphical interfaces
The relations among graphical representations, computer functionality, and everyday objects are more complex than terms like “the desktop metaphor” may suggest. While metaphor...
William W. Gaver
AVI
2004
15 years 6 months ago
Sim-U-Sketch: a sketch-based interface for SimuLink
Sim-U-Sketch is an experimental sketch-based interface we developed for Matlab 's Simulink software package. With this tool, users can construct functional Simulink models si...
Levent Burak Kara, Thomas F. Stahovich