1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-13818-8_16
DC FieldValue
dc.titleDiscovery of evolving convoys
dc.contributor.authorAung, H.H.
dc.contributor.authorTan, K.-L.
dc.date.accessioned2013-07-04T08:44:49Z
dc.date.available2013-07-04T08:44:49Z
dc.date.issued2010
dc.identifier.citationAung, H.H.,Tan, K.-L. (2010). Discovery of evolving convoys. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6187 LNCS : 196-213. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-13818-8_16" target="_blank">https://doi.org/10.1007/978-3-642-13818-8_16</a>
dc.identifier.isbn3642138179
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42158
dc.description.abstractTraditionally, a convoy is defined as a set of moving objects that are close to each other for a period of time. Existing techniques, following this traditional definition, cannot find evolving convoys with dynamic members and do not have any monitoring aspect in their design. We propose new concepts of dynamic convoys and evolving convoys, which reflect real-life scenarios, and develop algorithms to discover evolving convoys in an incremental manner. © 2010 Springer-Verlag Berlin Heidelberg.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-13818-8_16
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/978-3-642-13818-8_16
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume6187 LNCS
dc.description.page196-213
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.