5608 search results - page 231 / 1122 » On the Theory of Matchgate Computations |
157
click to vote
BIRTHDAY
2004
Springer
16 years 13 hour ago
2004
Springer
A long-standing complaint about the theory of CSP has been that all theories which encompass divergence are divergence-strict, meaning that nothing beyond the first divergence ca...
157
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
152
Voted
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
168
click to vote
SIGECOM
2005
ACM
16 years 5 days ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
183
click to vote
AAAI
1993
15 years 8 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...