In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel synta...
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...