Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
This paper describes a system and annotation language, MECA, for checking security rules. MECA is expressive and designed for checking real systems. It provides a variety of pract...
Junfeng Yang, Ted Kremenek, Yichen Xie, Dawson R. ...
ABSTRACT. As informal methods do little to help their use for concurrent and distributed programming, one of the most challenging current tasks is to build tools based on formal me...
Fabien Dagnat, Marc Pantel, Matthias Colin, Patric...
Natural language technologies have been long envisioned to play a crucial role in transitioning from the current Web to a more "semantic" Web. If anything, the significa...
Peter Mika, Massimiliano Ciaramita, Hugo Zaragoza,...