Sciweavers

74 search results - page 14 / 15
» Scalable network distance browsing in spatial databases
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 11 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
13 years 11 months ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
VLDB
2008
ACM
170views Database» more  VLDB 2008»
14 years 6 months ago
A layered framework supporting personal information integration and application design for the semantic desktop
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
Isabel F. Cruz, Huiyong Xiao
INFOCOM
2007
IEEE
14 years 17 days ago
A Cross-Layer Architecture to Exploit Multi-Channel Diversity with a Single Transceiver
—The design of multi-channel multi-hop wireless mesh networks is centered around the way nodes synchronize when they need to communicate. However, existing designs are confined ...
Jay A. Patel, Haiyun Luo, Indranil Gupta
GIS
2009
ACM
14 years 7 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...