Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...
It is proved in this paper that every bipartite graphic sequence with the minimum degree 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture ...
This paper addresses the problem of virtual pedestrian autonomous navigation for crowd simulation. It describes a method for solving interactions between pedestrians and avoiding ...
The selection of the appropriate colorspace for tracking applications has not been an issue previously considered in the literature. Many color representations have been suggested...
Francesc Moreno-Noguer, Alberto Sanfeliu, Dimitris...
Abstract. This paper presents two approaches to the problem of simultaneous tracking of several people in low resolution sequences from multiple calibrated cameras. Spatial redunda...
Cristian Canton-Ferrer, Jordi Salvador, Josep R. C...