Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...
Recently, almost uncontrolled technological progress allows so called high-throughput data collection for sophisticated and complex experimental biological systems analysis. Espec...
: We propose in this article an object-oriented approach to rewriting queries using views. Our approach aims to mitigate certain limitations of existing query rewriting approaches....
We address the problem of simplifying Portuguese texts at the sentence level treating it as a "translation task". We use the Statistical Machine Translation (SMT) framewo...