4324 search results - page 254 / 865 » A Generalized Representer Theorem |
125
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
161
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
180
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
189
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
166
click to vote
FSEN
2007
Springer
16 years 23 days ago
2007
Springer
This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine lana manageable level of abstraction without making simpli...