摘要
文中将多媒体时间同步问题转化为一个有向带权图的平衡权值分配问题．针对这样一个强ＮＰ类难解问题，提出了节点删除法和图分解法来处理原始图，尽可能地降低计算复杂性，从而有效地解决多媒体时间同步问题．
The multimedia temporal relationship is transformed into a weighted bi directional graph model and the multimedia temporal synchronization problems are regarded as the buffer assignment problems.Since the buffer assignment problem belongs to the strong NP completeness,vertex deletion and graph decomposition approaches are proposed to solve efficiently the multimedia temporal synchronization problem.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1998年第5期426-430,共5页
Journal of Computer Research and Development
基金
"863"高技术计划
关键词
多媒体
时间同步
节点删除
图分解
算法
multimedia,temporal synchronization,vertex deletion,graph decomposition
