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...
— In distributed wireless access networks, the short-term unfairness of IEEE 802.11 Distributed Coordination Function (DCF) has been revealed by many works. In this paper, a modi...
— This paper is based on a comprehensive dynamic mathematical model (Copernicus) of vascular bubble formation and growth during and after decompression from a dive. The model des...
Le Feng, Christian R. Gutvik, Tor Arne Johansen, D...
The cultural heritage domain dealing with digital surrogates of rare and fragile historic artifacts is one of the most promising areas for establishing collaboratories, i.e. shared...
Assessing the reliability of a software system has always been an elusive target. A program may work very well for a number of years and this same program may suddenly become quit...