54 search results - page 4 / 11 » Minimizing the communication cost for continuous skyline mai... |
TKDE
2008
13 years 7 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
INFOCOM
1999
IEEE
13 years 11 months ago
1999
IEEE
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
JSW
2007
13 years 7 months ago
2007
— The efficiency of overlay networks built on top of the IP network is often threatened by the mismatch between the topologies of the overlay and the underlying IP network, resu...
ICCCN
2008
IEEE
14 years 1 months ago
2008
IEEE
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...