911 search results - page 92 / 183 » On the Distance of Databases |
160
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
141
Voted
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
130
Voted
DEXA
2007
Springer
15 years 10 months ago
2007
Springer
Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two li...
152
Voted
SSD
2005
Springer
15 years 10 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
147
Voted
DASFAA
2010
IEEE
15 years 9 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...