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...
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
In this paper weexplore the computationalaspects of Propositional PowerDefault Reasoning (PDR),a form of non-monotonicreasoning whichthe underlyinglogic is Kleene's3-valued p...
In this paper we derive a general system of transport equations for the moments of reflected and transmitted mode amplitudes in a randomly perturbed waveguide, in a regime where ba...
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...