11016 search results - page 693 / 2204 » Cloud Computing for Science |
189
click to vote
DIS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
185
click to vote
RELMICS
2009
Springer
16 years 1 months ago
2009
Springer
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...
223
Voted
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
212
Voted
ACSC
2008
IEEE
16 years 1 months ago
2008
IEEE
The International Olympiad in Informatics is a worldwide contest for high school students, with a strong focus on creativity and ingenuity in algorithm design. Here we describe th...