17298 search results - page 303 / 3460 » Abstract computing machines |
174
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
162
click to vote
JIFS
2002
15 years 6 months ago
2002
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
178
click to vote
TCS
2010
15 years 5 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
193
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
152
click to vote
ICALT
2009
IEEE
16 years 1 months ago
2009
IEEE
With the aim of facilitating teachers the use of good techniques in computer assisted assessment, this paper proposes the integration of rubric functionalities in an editor compli...