Sciweavers

5084 search results - page 204 / 1017
» Proving Possibility Properties
Sort
View
ASIAN
2009
Springer
299views Algorithms» more  ASIAN 2009»
15 years 7 months ago
Deducibility Constraints
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
DAM
2008
70views more  DAM 2008»
15 years 6 months ago
Pairings for cryptographers
Many research papers in pairing based cryptography treat pairings as a "black box". These papers build cryptographic schemes making use of various properties of pairings....
Steven D. Galbraith, Kenneth G. Paterson, Nigel P....
IGPL
2008
124views more  IGPL 2008»
15 years 6 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
ICPR
2002
IEEE
16 years 7 months ago
Building the Topological Tree by Recursive FCM Color Clustering
In this paper we define a Topological Tree (TT) as a knowledge representation method that aims to describe important visual and spatial features of image regions, namely the color...
Rita Cucchiara, Costantino Grana, Andrea Prati, St...
POPL
2009
ACM
16 years 7 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander