English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 95844/126434 (76%)
Visitors : 31570016      Online Users : 535
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 會議論文 >  Item 140.119/39701
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/39701

    Title: Efficient Processing of Probabilistic Spatial-Temporal Range Queries over Moving Objects
    Authors: 陳良弼
    Chen, Arbee L.P.
    Contributors: 國立政治大學資訊科學系
    Keywords: Probabilistic Spatial-Temporal Range Queries;Moving Objects
    Date: 2008-10
    Issue Date: 2010-05-27 16:48:51 (UTC+8)
    Abstract: Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that an object only moves along an anticipated path. In this paper, we study the problem of answering probabilistic range queries on moving objects based on an uncertainty model, which captures the possible movements of objects with probabilities. We conduct a performance study, which shows our proposal significantly reduces the number of object examinations and the overall cost of the query evaluation.
    Relation: ACM International Conference on Information and Knowledge Management
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1145/1458082.1458300
    DOI: 10.1145/1458082.1458300
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    1399-1400.pdf203KbAdobe PDF264View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback