Motion estimation (ME) process consumes up to 70% of the total encoding time of video transmission. Because it has a high coding efficiency and it is very scalable, the full search (FS) algorithm is considered to be the most popular ME algorithm

This paper proposes a unitable multi-core architecture, called hyperscalar , that can dynamically unite many scalar cores as a larger superscalar processor to accelerate a thread.

Crowds must be simulated believable in terms of their appearance and behavior to improve a virtual environment’s realism. Due to the complex nature of human behavior, realistic behavior of agents in crowd simulations is still a challenging problem. In this paper, we propose a novel behavioral model which builds analytical maps to control agents’ behavior adaptively with agent–crowd interaction formulations.

The L (2, 1)-labeling of a digraph G is a function f from the node set of G to the set of all non-negative integers such that | f ( x )– f ( y )| ≥ 2 if x and y are at distance 1, and f ( x ) != f ( y ) if x and y are at distance 2, where the distance from node x to node y is the length of a shortest dipath from x to y . The minimum over all L (2, 1)-labeling of G of the largest used label is called

In this paper, a new compression scheme is presented, inspired by the synchronized extension systems, a mechanism somehow conceptually similar to dictionary compression. As in the case of traditional dictionary compression methods, the input sequence is parsed into blocks and the repeating blocks are identified