105 search results - page 3 / 21 » Verifying an Applicative ATP Using Multiset Relations |
97
Voted
PEPM
2010
ACM
15 years 9 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
107
click to vote
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
ICSE
2004
IEEE-ACM
16 years 10 days ago
2004
IEEE-ACM
Semantic Web, the next generation of Web, gives data well-defined and machine-understandable meaning so that they can be processed by remote intelligent agents cooperatively. Onto...
107
click to vote
CCS
2010
ACM
15 years 13 days ago
2010
ACM
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
103
click to vote
TCC
2009
Springer
16 years 24 days ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...