444 search results - page 15 / 89 » Instance optimal query processing in spatial networks |
AMW
2010
13 years 9 months ago
2010
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
GIS
2008
ACM
13 years 9 months ago
2008
ACM
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We study the problem of in-network processing and queries of trajectories of moving targets in a sensor network. The main idea is to exploit the spatial coherence of target traj...