Sciweavers

199 search results - page 7 / 40
» Denotations for Classical Proofs - Preliminary Results
Sort
View
CIE
2009
Springer
14 years 2 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
JMLR
2012
11 years 10 months ago
Algorithms for Learning Kernels Based on Centered Alignment
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh
JGT
2010
103views more  JGT 2010»
13 years 6 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 5 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi