Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) ∈ S × R...
We consider trails to be a document type of growing importance, authored in abundance as locative technologies become embedded in mobile devices carried by billions of humans. As ...
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
— In this paper1 we address the problem of processing continuous multi-join queries, over distributed data streams. Our approach makes use of existing work in the field of publi...
Oana Jurca, Sebastian Michel, Alexandre Herrmann, ...
— In large Wireless Sensor Networks (WSNs), each hop might incur varying delays due to medium access contention, transmission and computation delays. Fast and efficient query re...
Xiaoming Lu, Matt Spear, Karl N. Levitt, Norman S....