Sciweavers

891 search results - page 11 / 179
» Full Abstraction for PCF
Sort
View
SBIA
2004
Springer
14 years 29 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 12 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
SIAMSC
2010
137views more  SIAMSC 2010»
13 years 2 months ago
Accuracy Measures and Fourier Analysis for the Full Multigrid Algorithm
Abstract. The full multigrid (FMG) algorithm is often claimed to achieve so-called discretizationlevel accuracy. In this paper, this notion is formalized by defining a worst-case r...
Carmen Rodrigo, Francisco J. Gaspar, Cornelis W. O...
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ñ...
CHI
1995
ACM
13 years 11 months ago
TileBars: Visualization of Term Distribution Information in Full Text Information Access
The field of information retrieval has traditionallyfocused on s consistingof titlesand abstracts. As a consequence, many underlying assumptions must be altered for retrieval fro...
Marti A. Hearst