English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54388/89187 (61%)
Visitors : 10568445      Online Users : 14
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/37386

    Title: A schedule/layout computation model
    Authors: 施國琛;Shih, Timothy K.;Chang, Anthony Y.
    Contributors: 淡江大學資訊工程學系
    Date: 1997-10-27
    Issue Date: 2010-04-15 10:17:02 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Abstract: The importance of relations among temporal intervals was found in a number of disciplines. In this paper, we propose a fast mechanism for temporal relation compositions. A temporal transitive closure table is derived, and an interval-based temporal relation algebraic system is constructed. Thus, we propagate the time constraints of arbitrary two objects across long distances n by linear time. The contributions of these algorithms can be used to generate the schedule and layout of multimedia presentations, to model the interaction of multimedia applications, to analyze the virtual reality timing constraints, and to compose multimedia documents.
    Relation: Real-Time Computing Systems and Applications, 1997. Proceedings., Fourth International Workshop on, pp.178-181
    DOI: 10.1109/RTCSA.1997.629208
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Proceeding

    Files in This Item:

    File Description SizeFormat
    0818680733_p178-181.pdf370KbAdobe PDF481View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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