On the complexity of coordinated display of multimedia objects

@article{EscobarMolano2000OnTC,
  title={On the complexity of coordinated display of multimedia objects},
  author={Martha Escobar-Molano and Shahram Ghandeharizadeh},
  journal={Theor. Comput. Sci.},
  year={2000},
  volume={242},
  pages={169-197}
}
A multimedia presentation can be represented as a collection of objects with temporal constraints that define when the objects are rendered. The display of a presentation is termed coordinated when the display of its objects respects the pre-specified temporal constraints. Otherwise, the display might suffer from failures that translate into meaningless scenarios. For example, a chase scene between a dinosaur and a jeep becomes meaningless if the system fails to render the dinosaur when… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Scheduling le transfers in fully connected networks. Networks

Rvvn, P I Rivera-Vega, R Varadarajan, S Navathe
  • Scheduling le transfers in fully connected networks. Networks
  • 1992

On-Line Algorithms, number 7

Ms L Mcgeoch, D Sleator
  • DIMACS Series in Discrete Mathematics and Theoretical Computer Science
  • 1991

The complexity of le transfer scheduling with forwarding

J Whi, Whitehead
  • SIAM Journal on Computing
  • 1990

Scheduling le transfers

Jgjl, E G Cooman, +3 authors Lapaugh
  • SIAM Journal on Computing
  • 1985