|
|
|
|
|
Holger Boche, Yannik N. Böck, Ullrich J. Mönich and Frank H. P. Fitzek
This article compares two methods of algorithmically processing bandlimited time-continuous signals in light of the general problem of finding ?suitable? representations of analog information on digital hardware. Albeit abstract, we argue that this probl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anna L. Trella, Kelly W. Zhang, Inbal Nahum-Shani, Vivek Shetty, Finale Doshi-Velez and Susan A. Murphy
Online reinforcement learning (RL) algorithms are increasingly used to personalize digital interventions in the fields of mobile health and online education. Common challenges in designing and testing an RL algorithm in these settings include ensuring th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tianxing Wu, Chaoyu Gao, Lin Li and Yuxiang Wang
In recent years, the scale of knowledge graphs and the number of entities have grown rapidly. Entity matching across different knowledge graphs has become an urgent problem to be solved for knowledge fusion. With the importance of entity matching being i...
ver más
|
|
|
|
|
|
|
|
|
|
|
Guillermo Morales-Luna
Este es el primer ensayo, de una serie de dos, en los que se quiere presentar visiones panorámicas de la noción de computabilidad de dos nuevos paradigmas de computación. A saber, la computación cuántica y la computación basada en ADN o molecular, así co...
ver más
|
|
|
|
|
|
|
|
|
|
|
Petrus Potgieter
Pág. 287 - 293
This paper attempts to define a general framework for computability on an arbitrary topological space X . The elements of X are taken as primitives in this approach?also for the coding of functions ? and, except when X = N, the natural numbers are...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rod G. Downey; Denis R. Hirschfeldt; Andri Nies
Pág. 1169 - 1183
|
|
|
|
|
|