We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
We describe here our ongoing research on modeling conceptual and narrative structure of fairytales by a computer system. In this paper we focus on the variations of fairytales base...
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
In this paper, we present an enhanced Pictorial Struc-
ture (PS) model for precise eye localization, a fundamen-
tal problem involved in many face processing tasks. PS is
a comp...
Xiaoyang Tan (Nanjing University of Aeronautics an...
We present in this paper a system which automatically
builds, from real images, a scene model containing both
3D geometric information of the scene structure and its
photometric...