Sciweavers

1763 search results - page 262 / 353
» A Formalization of Polytime Functions
Sort
View
PKC
2009
Springer
240views Cryptology» more  PKC 2009»
15 years 10 months ago
Distributed Public-Key Cryptography from Weak Secrets
Abstract.We introduce the notion of distributed password-based publickey cryptography, where a virtual high-entropy private key is implicitly dened as a concatenation of low-entrop...
Céline Chevalier, David Pointcheval, Michel...
MOBIHOC
2009
ACM
15 years 10 months ago
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
Dezun Dong, Yunhao Liu, Xiangke Liao
CHI
2008
ACM
15 years 10 months ago
Heuristic evaluation for games: usability principles for video game design
Most video games require constant interaction, so game designers must pay careful attention to usability issues. However, there are few formal methods for evaluating the usability...
David Pinelle, Nelson Wong
VLSID
2002
IEEE
189views VLSI» more  VLSID 2002»
15 years 10 months ago
Automatic Modeling and Validation of Pipeline Specifications Driven by an Architecture Description Language
Verification is one of the most complex and expensive tasks in the current Systems-on-Chip (SOC) design process. Many existing approaches employ a bottom-up approach to pipeline v...
Prabhat Mishra, Hiroyuki Tomiyama, Ashok Halambi, ...
POPL
2006
ACM
15 years 10 months ago
The next 700 data description languages
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
Kathleen Fisher, Yitzhak Mandelbaum, David Walker