109 search results - page 4 / 22 » How to Win a Game with Features |
SIAMDM
2010
13 years 5 months ago
2010
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
A new multi-core DSP board is available for university and industry engineers. The LogicPD ZoomTM OMAP-L138 eXperimenter Kit, featuring Texas Instruments’ dual core SoC (ARM9 an...
IGPL
2010
13 years 5 months ago
2010
: Popper s suggestion of taking methodological norms as conventions is examined from the point of view of game theory. The game of research is interpreted as a game of persuasion, ...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
— This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on realworld link predictio...