7 search results - page 2 / 2 » Shortest path to a segment and quickest visibility queries |
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
PKDD
2005
Springer
14 years 3 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...