849 search results - page 144 / 170 » Completely Non-malleable Schemes |
168
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
179
click to vote
ICSE
2004
IEEE-ACM
16 years 6 months ago
2004
IEEE-ACM
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
196
click to vote
ASIACRYPT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
140
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
183
click to vote
AFRIGRAPH
2007
ACM
15 years 10 months ago
2007
ACM
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...