Sciweavers

220 search results - page 5 / 44
» Using Difference Reduction for Generic Proof Search
Sort
View
APAL
2010
98views more  APAL 2010»
13 years 8 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
CVPR
1999
IEEE
14 years 10 months ago
Generic Object Detection using Model Based Segmentation
This paper presents a novel approach for detection and segmentation of generic shapes in cluttered images. The underlying assumption is that generic objects that are man made, fre...
Zhiqian Wang, Jezekiel Ben-Arie
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 8 months ago
The craft of model making: PSPACE bounds for non-iterative modal logics
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
Lutz Schröder, Dirk Pattinson
AAAI
2007
13 years 10 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre