1007 search results - page 45 / 202 » The Complexity of Futile Questioning |
STOC
2000
ACM
14 years 1 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
ECIS
2004
13 years 11 months ago
2004
As Information Systems (IS) research increasingly acknowledges the importance of non-positivist approaches, the case for a plurality of theories to guide qualitative studies has g...
RECOMB
2007
Springer
14 years 10 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
SIGMETRICS
2010
ACM
14 years 2 months ago
2010
ACM
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...