Sciweavers

8780 search results - page 348 / 1756
» On the Feasibility of Consistent Computations
Sort
View
CHI
2007
ACM
16 years 8 months ago
Demonstrating the viability of automatically generated user interfaces
We conducted two studies that demonstrate automatically generated interfaces can be more usable than interfaces created by human designers. The first study shows that users of aut...
Jeffrey Nichols, Duen Horng Chau, Brad A. Myers
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
16 years 2 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
STACS
1992
Springer
15 years 11 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...
IEEEPACT
2003
IEEE
16 years 25 days ago
Constraint Graph Analysis of Multithreaded Programs
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
Harold W. Cain, Mikko H. Lipasti, Ravi Nair
CVPR
1998
IEEE
16 years 9 months ago
Probabilistic Reasoning Models for Face Recognition
We introduce in this paper two probabilistic reasoning models (PRM-1 and PRM-2) which combine the Principal Component Analysis (PCA) technique and the Bayes classifier and show th...
Chengjun Liu, Harry Wechsler