148 search results - page 14 / 30 » Strong and Weak Policy Relations |
COMBINATORICA
2008
14 years 10 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
SLOGICA
2010
14 years 10 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
ACL
2009
14 years 9 months ago
2009
We examine correlations between native speaker judgements on automatically generated German text against automatic evaluation metrics. We look at a number of metrics from the MT a...
IMCSIT
2010
14 years 9 months ago
2010
In this paper we present RefGen, a reference chain identification module for French. RefGen algorithm uses genre specific properties of reference chains and an accessibility measur...
102
click to vote
LAWEB
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents the results of a qualitative research whose objective was to broaden the understanding on the participation of youngsters and adolescents on Internet-based soc...