5608 search results - page 21 / 1122 » On the Theory of Matchgate Computations |
COMBINATORICS
1999
15 years 1 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
115
click to vote
INLG
2010
Springer
14 years 11 months ago
2010
Springer
Today there exist a growing number of framenet-like resources offering semantic and syntactic phrase specifications that can be exploited by natural language generation systems. I...
121
click to vote
FOSSACS
2011
Springer
14 years 4 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
CORR
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994 , the n...
128
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...