250 search results - page 22 / 50 » Fixed Argument Pairings |
COMBINATORICS
2000
13 years 9 months ago
2000
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, and with every pair of points occurring in a unique block; for a fixed K, B(K) i...
DAM
2002
13 years 9 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
ACL
2010
13 years 8 months ago
2010
This paper improves the use of pseudowords as an evaluation framework for selectional preferences. While pseudowords originally evaluated word sense disambiguation, they are now c...
DIS
2010
Springer
13 years 7 months ago
2010
Springer
How to achieve shared meaning is a significant issue when more than one intelligent agent is involved in the same domain. We define the task of concept convergence, by which intell...
ICFP
2007
ACM
14 years 9 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...