BookDOI
Interactive Multimedia Documents
About:
The article was published on 1999-01-01. It has received 2 citations till now. The article focuses on the topics: Interactive media.read more
Citations
More filters
It s Time to Link! On the Development of Time-Sensitive Linking Structures for the Web
TL;DR: It is demonstrated in this thesis that XLink’s (XML Linking Language) multiple linking, link traversal rules and linkbases with a timerule namespace extension can be used to realize time-sensitive linking structures in professional Web-based applications.
Adaptation de documents multimédia : Approche sémantique de la dimension spatiotemporelle des documents SMIL
TL;DR: In this paper, the authors propose an approche semantique a ete developpee a partir de specifications qualitative des documents multimedia, and raffinons les mesures de proximite a l'aide de graphes de voisinage adaptes au type d'objets multimedia manipules ainsi qu'au type de specification utilise.
References
More filters
Journal Article
Maintaining knowledge about temporal intervals
TL;DR: An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.
Journal ArticleDOI
Maintaining knowledge about temporal intervals
TL;DR: In this paper, an interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between time and space.
Proceedings ArticleDOI
R-trees: a dynamic index structure for spatial searching
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
Journal ArticleDOI
Multidimensional binary search trees used for associative searching
TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Proceedings ArticleDOI
The R*-tree: an efficient and robust access method for points and rectangles
TL;DR: The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.