Sciweavers

11063 search results - page 118 / 2213
» On the existence of universal models
Sort
View
FOCS
1999
IEEE
14 years 2 months ago
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
Jeong Han Kim, Daniel R. Simon, Prasad Tetali
IEEEICCI
2006
IEEE
14 years 4 months ago
Rough Set Method Based on Multi-Granulations
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
Y. H. Qian, J. Y. Liang
WCCE
2001
105views Education» more  WCCE 2001»
13 years 11 months ago
Designing an IT College
: The University of the United Arab Emirates (UAEU) commissioned an international panel of experts to devise a model curriculum for their new College of Information Technology. The...
Peter J. Denning, Ravi Athale, Nada Dabbagh, Danie...
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
13 years 8 months ago
Efficient Detection of Errors in Java Components Using Random Environment and Restarts
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
Pavel Parizek, Tomás Kalibera
AML
2008
57views more  AML 2008»
13 years 10 months ago
Sheaf toposes for realizability
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
Steven Awodey, Andrej Bauer