612 search results - page 92 / 123 » Hardness assumptions in the foundations of theoretical compu... |
DIALM
2010
ACM
13 years 5 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
CHI
2006
ACM
14 years 8 months ago
2006
ACM
Elaborating on the first stage in the User-Centered Design (UCD) process, understanding the user, this study questions whether it is sufficient to look at the use of interactive s...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...