We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
— This paper investigates the topology formation mechanisms provided by IEEE 802.15.4 to create tree-based topologies, in the context of a multi-sink wireless sensor network. The...
Chiara Buratti, Francesca Cuomo, Sara Della Luna, ...
In this paper, we focus on a recent Web trend called microblogging, and in particular a site called Twitter. The content of such a site is an extraordinarily large number of small...
Beaux Sharifi, Mark-Anthony Hutton, Jugal K. Kalit...
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...