We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Abstract In this study we set to investigate visual attention properties of freely behaving barn owls using a miniature wireless camera attached to their heads. The tubular eye str...
Shay Ohayon, Wolf Harmening, Hermann Wagner, Ehud ...
Sequential change diagnosis is the joint problem of detection and identification of a sudden and unobservable change in the distribution of a random sequence. In this problem, the...
Savas Dayanik, Christian Goulding, H. Vincent Poor
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...