— Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of netw...
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
Peers and data objects in the Hybrid Overlay Network (HON) are organized in a ndimensional feature space. As the dimensionality increases, peers and data objects become sparse and ...
The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k 3. We prove that superposition coding is indeed ...
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...