Sciweavers

75 search results - page 15 / 15
» Abstract Interpretation of Proofs: Classical Propositional C...
Sort
View
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 5 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
Logical settings for concept learning from incomplete examples in First Order Logic
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
Dominique Bouthinon, Henry Soldano, Véroniq...
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 7 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
12 years 10 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...