In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Abstract. We investigate the computational complexity of reasoning over temporal extensions of conceptual data models. The temporal conceptual models we analyse include the standar...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...
In this paper, we investigate the detection of semantic
human actions in complex scenes. Unlike conventional
action recognition in well-controlled environments,
action detection...
A single face classifier has difficulty in detecting multiview faces under real and complex scenes due to various poses, cluttering environment and small size of faces. In this pa...