In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu
When multiple video sources are live-encoded and transmitted over a common wireless network, each stream needs to adapt its encoding parameters to wireless channel fluctuations, ...