Sciweavers

2516 search results - page 35 / 504
» When is there a representer theorem
Sort
View
CADE
2000
Springer
15 years 10 months ago
Automated Proof Construction in Type Theory Using Resolution
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
CRYPTO
2011
Springer
222views Cryptology» more  CRYPTO 2011»
14 years 6 months ago
Computer-Aided Security Proofs for the Working Cryptographer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
JCT
2006
110views more  JCT 2006»
15 years 6 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
ICIP
1994
IEEE
15 years 10 months ago
Spatially-Variant Mathematical Morphology
We develop a general theory of spatially-variant (SV) mathematical morphology for binary images in the Euclidean space. The basic SV morphological operators (that is, SV erosion, S...
Mohammed Charif-Chefchaouni, Dan Schonfeld
EMNLP
2008
15 years 7 months ago
A Graph-theoretic Model of Lexical Syntactic Acquisition
This paper presents a graph-theoretic model of the acquisition of lexical syntactic representations. The representations the model learns are non-categorical or graded. We propose...
Hinrich Schütze, Michael Walsh