1414 search results - page 35 / 283 » Randomness and Universal Machines |
186
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
137
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
110
click to vote
ICML
1998
IEEE
16 years 4 months ago
1998
IEEE
Three factors are related in analyses of performance curves such as learning curves: the amount of training, the learning algorithm, and performance. Often we want to know whether...
148
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
135
click to vote
MFPS
1993
15 years 7 months ago
1993
al abstract machine for graph reduction Alan Jeffrey Report 3/92 August 1992 Computer Science School of Cognitive and Computing Sciences University of Sussex Brighton BN1 9QH ISSN ...