Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
Sergio Cabello, Panos Giannopoulos, Christian Knau...
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
: Current multicast routing protocols have not been designed for mobile nodes and especially roaming sources. Using the remote subscription as basis, we develop a new approach base...
The university campus is an interesting application environment for the ubiquitous computing paradigm: a large number of users share a substantial amount of their information need...
— In the current Internet, many applications start sessions with multiple connections to multiple servers in order to expedite the reception of data. One may argue that such aggr...
Pradnya Karbhari, Ellen W. Zegura, Mostafa H. Amma...