1413 search results - page 42 / 283 » A Theory for Memory-Based Learning |
220
click to vote
BVAI
2007
Springer
15 years 10 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
160
click to vote
NIPS
2008
15 years 6 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
169
click to vote
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
15 years 4 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
144
click to vote
AII
1989
15 years 8 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
139
click to vote
CLEIEJ
2008
15 years 4 months ago
2008
In the past few years Artificial Intelligence has been gradually introduced to enhance Education through technologies. However, usual approaches provide systems with a kind of exp...