We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Abstract. Model-driven software development often involves several related models. When models are updated, the updates need to be propagated across all models to make them consist...
— A new rate control algorithm for the H.264 encoder is developed in this work. There are several unique features in the proposed rate control scheme. First, a two-stage encoding...