13784 search results - page 355 / 2757 » On Computing Functions with Uncertainty |
169
Voted
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
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...
166
click to vote
ICS
1997
Tsinghua U.
15 years 10 months ago
1997
Tsinghua U.
This paper makes the case for the use of XOR-based placement functions for cache memories. It shows that these XOR-mapping schemes can eliminate many conflict misses for direct-ma...
212
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents new technology that accelerates system verification. Traditional methods for verifying functional designs are based on logic simulation, which becomes more tim...
161
click to vote
VLDB
1987
ACM
15 years 10 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
162
click to vote
APAL
2002
15 years 6 months ago
2002
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...