Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

65

Voted

PVLDB
2008

favoriteEmaildiscussreport

81views more PVLDB 2008»

On efficiently searching trajectories and archival data for historical similarities

14 years 10 months ago

On efficiently searching trajectories and archival data for historical similarities

Download webdocs.cs.ualberta.ca

We study the problem of efficiently evaluating similarity queries on histories, where a history is a d-dimensional time

Reza Sherkat, Davood Rafiei

Real-time Traffic

D-dimensional Time | PVLDB 2008 |

claim paper

Related Content

» Creating an Historical Archive Ontology Guidelines and Evaluation

» Similaritybased prediction of travel times for vehicles traveling on known routes

» Algorithms for Nearest Neighbor Search on Moving Object Trajectories

» Efficient Similarity Search over Future Stream Time Series

» Distributed spatiotemporal similarity search

» Efficient anomaly monitoring over moving object trajectory streams

» Efficient search in large textual collections with redundancy

» Efficient Adaptive Retrieval and Mining in Large Multimedia Databases

» Catching the drift learning broad matches from clickthrough data

Post Info
More Details (n/a)

Added	28 Dec 2010
Updated	28 Dec 2010
Type	Journal
Year	2008
Where	PVLDB
Authors	Reza Sherkat, Davood Rafiei

Comments (0)