Sciweavers

877 search results - page 14 / 176
» Full Abstraction for HOPLA
Sort
View
WOLLIC
2009
Springer
14 years 2 months ago
Spoilt for Choice: Full First-Order Hierarchical Decompositions
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
Sebastian Link
ICICS
2007
Springer
14 years 1 months ago
Extending FORK-256 Attack to the Full Hash Function
Abstract. In a paper published in FSE 2007, a way of obtaining nearcollisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained ex...
Scott Contini, Krystian Matusiewicz, Josef Pieprzy...
SBIA
2004
Springer
14 years 25 days ago
Towards Polynomial Approximations of Full Propositional Logic
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
Marcelo Finger
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
On the Exact Security of Full Domain Hash
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
Jean-Sébastien Coron
CLEF
2005
Springer
14 years 1 months ago
A Full Data-Driven System for Multiple Language Question Answering
Abstract. This paper describes a full data-driven system for question answering. The system uses pattern matching and statistical techniques to identify the relevant passages as we...
Manuel Montes-y-Gómez, Luis Villaseñ...