60 search results - page 12 / 12 » Some extensions of the Cauchy-Davenport theorem |
TACS
1994
Springer
13 years 10 months ago
1994
Springer
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
RTA
1995
Springer
13 years 9 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
JMLR
2006
13 years 6 months ago
2006
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
PEPM
2010
ACM
13 years 8 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...