380 search results - page 18 / 76 » The End of Science Revisited |
STACS
2001
Springer
15 years 2 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
75
Voted
TLCA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper, we introduce a new type system, the Implicit Calculus of Constructions, which is a Curry-style variant of the Calculus of Constructions that we extend by adding an i...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such ...
DIS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In multi-instance learning, each example is described by a bag of instances instead of a single feature vector. In this paper, we revisit the idea of performing multi-ins...
73
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...