We present new non-deterministic finite state machine (NFSM) abstraction techniques for comparators based on the comparison difference of the two operands (e.g., counters) instead of the comparison order. One of the major advantages of the comparison ...

Although duplicated code is known to pose severe problems for software maintenance, it is difficult to identify in large systems. Many different techniques have been developed to detect software clones, some of which are very sophisticated, but are also ...

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv-Lempel trie, called the LZ-index, that takes 4n log2 ...

The paper presents a novel way of matching score calculation for LDA-based face verification. Different from the classical matching schemes, where the decision regarding the identity of the user currently presented to the face verification system is ...

ELAN was one of the first rule based language to introduce a clear separation between the notion of rule and the notion of control, also called strategy. Starting from this experience, our goal was to make available these constructs in a widely used ...

We introduce the Spicy system, a novel approach to the problem of automatically selecting the best mappings among two data sources. Known schema mapping algorithms rely on value correspondences -- i.e. correspondences among semantically related attributes ...

Traditionally, technology mapping is done by first partitioning a circuit into a forest of trees. Each individual tree is then mapped using dynamic programming. The links among the mappings of different trees are provided via propagating the essential ...

In this work, we systematically study the problem of event recognition in unconstrained news video sequences. We adopt the discriminative kernel-based method for which video clip similarity plays an important role. First, we represent a video clip as ...

The problem of segmenting an image sequence in terms of regions characterized by a coherent motion is among the most challenging in image sequence analysis. This paper proposes a new technique which sequentially refines the segmentation and the motion ...

Service-centric software systems offer new opportunities for requirements processes. This paper reports a new tool designed to increase the completeness of system requirements using information about designs and implementations of web services. It presents ...

In recent years, multimedia content processing has become a hot topic with the rapid development of information technology and popularity of World Wide Web. Among the emerging research topics, content-based video retrieval is an attractive and challenging ...

Abstract: In computer aided design, geometric modelling by constraints enables users to describe geometric objects by geometric constraints. Many resolution methods have been proposed for solving systems of geometric constraints. Geometric methods can ...

Greedy scheduling heuristics provide a low complexity and scalable albeit particularly sub-optimal strategy for hardware-based crossbar schedulers. In contrast, the maximum matching algorithm for Bipartite graphs can be used to provide optimal scheduling ...

Plan recognition can be considered as a problem of dynamic classification of multiple hypotheses. It is studied in Artificial Intelligence in a variety of research domains. In this paper, the plan recognition theory is first simply introduced. A plan ...

The main problem for building a mosaic is the computation of the warping functions (homographies). In fact two cases are to be distinguished. The first is when the homography is mainly a translation (i.e. the rotation around the optical axis and the ...

Scatter search is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and ...

Two equal length strings s and s′, over alphabets Σ_s and Σ_s′, parameterize match if there exists a bijection π : Σ_s → Σ_s′ ...

Product customization leads to an exponentially increased number of product and process variants, which exaggerates the difficulties in building up customization capabilities for make-to-order production systems. It is imperative for companies to configure ...