Abstract-- We study routing for massively dense wireless networks, i.e., wireless networks that contain so many nodes that, in addition to their usual microscopic description, a no...
This paper proves that in Size Theory the comparison of multidimensional size functions can be reduced to the 1-dimensional case by a suitable change of variables. Indeed, we show...
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
We present an accurate Lagrangian method based on vortex particles, level-sets, and immersed boundary methods, for animating the interplay between two fluids and rigid solids. We ...
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
: Recent works have investigated the problem of the conflict redistribution in the fusion rules of evidence theories. As a consequence of these works, many new rules have been prop...
We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for...