5608 search results - page 861 / 1122 » On the Theory of Matchgate Computations |
177
click to vote
ACL
1994
15 years 8 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
176
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
185
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
157
click to vote
APAL
2010
15 years 6 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
160
click to vote
AO
2007
15 years 6 months ago
2007
One of the major goals of ontology is to represent properly the underlying conceptual structure of the messy world reflecting the reality as much as possible. Ontology building to...