The presence of deterministic relations pose problems for current algorithms that learn the causal structure of a system based on the observed conditional independencies. Deterministic variables lead to information equivalences; two sets of variables have the same information about a third variable. Based on information content, one cannot decide on the direct causes. Several edges model equall...

0

Present virtual heritage projects are mostly focused either on ‘process’ or ‘product’ but rarely consider ‘user’ (end user’s perception of the content) with project contents predominantly developed with an ‘ocular-centric’ tendency. There is no signifi cant interpretation method or principles for interpreting digital heritage unlike other disciplines such as archaeology. This paper argues that,...

We present a new tree based approach to composing expressive image descriptions that makes use of naturally occuring web images with captions. We investigate two related tasks: image caption generalization and generation, where the former is an optional subtask of the latter. The high-level idea of our approach is to harvest expressive phrases (as tree fragments) from existing image description...

In this paper we survey results related to homomorphism dualities for graphs, and more generally, for finite structures. This is related to some of the classical combinatorial problems, such as colorings of graphs and hypergraphs, and also to recently intensively studied Constraint Satisfaction Problems. On the other side dualities are related to the descriptive complexity and First Order defin...

The paper analyzed here presents two novel techniques for reducing energy consumption, based on Razor DVS, a global voltage scaling scheme. The new techniques involve local (per-pipeline-stage) voltage scaling and time borrowing to improve pipeline balance. The finer granularity control offered by these local techniques significantly improves power consumption reduction when compared to Razor D...

In this paper we continue our research line on logical characterizations of behavioral metrics obtained from the definition of a metric over the set of logical properties of interest. This time we provide a characterization of both strong and weak trace metric on nondeterministic probabilistic processes, based on a minimal boolean logic L which we prove to be powerful enough to characterize str...

Purely image-based approaches to tracking objects in video sequences are more prone to failure the higher an object’s speed, as it covers a greater distance over the camera’s exposure time and is subject to increased motion blur. These algorithms are also susceptible to changes in the object’s appearance and illumination. In this paper, we approach this problem by asynchronously recording local...

A new distance function for fuzzy sets is introduced. It is based on the descriptive complexity, that is, the number of bits (on average) that are needed to describe an element in the symmetric difference of the two sets. The value of the distance gives the amount of additional information needed to describe either one of the two sets when the other is known. We prove that the distance function...