28 search results - page 3 / 6 » Some formulae for partitions into squares |
CORR
2002
Springer
13 years 5 months ago
2002
Springer
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
CGF
1999
13 years 5 months ago
1999
This work explores how three techniques for defining and representing curves and surfaces can be related efficiently. The techniques are subdivision, least-squares data fitting, a...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logically attractive theory of the semantics of natural language questions, commonly referred to as the partition t...
COMBINATORICS
2007
13 years 6 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...