This paper presents indispensable technical results of a general theory that will allow to systematically derive from a given reduction system a behavioral congruence that respects concurrency. The theory is developed in the setting of adhesive categories and is based on the work by Ehrig and König on borrowed contexts; the latter are an instance of relative pushouts, which have been proposed b...

ÐWe address the problem of rejecting false matches of points between two perspective views. The two views are taken from two arbitrary, unknown positions and orientations. Even the best algorithms for image matching make some mistakes and output some false matches. We present an algorithm for identification of the false matches between the views. The algorithm exploits the possibility of rotati...

We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes selectivity estimates for each relaxed XML query, using a natural generalization of the correlated subpath tree (CST) summary structure, and (2) carefully combines these estimates by analyzing the nature of overlap between the dif...

The aim of this study was to explore the effect of characteristics of various games and players on the proportion of retired tennis matches in the Open Era of tennis. The data included over 420,000 matches played among 17,553 tennis players in the period from 1968 to the end of 2010. The influence of the surface type was clearly confirmed, with the proportion of retired matches being higher on ...

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of...

The alignment method Huttenlocher and Ullman, 1990] is a model-based object recognition technique that determines possible object transformations from three hypothesized matches of model and image points. In the absence of grouping, the alignment method must examine each possible matching of three model points with three image points. Thus, if m is the number of model features and n is the numb...

This paper presents the method we used in the prediction challenge organised by the Sports Analytics Lab of the KU Leuven for the European football(soccer) championship. We built a generalised linear model to predict the score of a match. This score was modelled as the joint probability of a Poisson distribution, representing the total number of goals, and a binomial distribution, representing ...

We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data structure. This problem is of interest for queries on XML and other hierarchical data, to provide query feedback and for costbased query optimization. Our summary data structure scalably representsapproximate frequency in...

Hash functions are used in authentication and cryptography, as well as for the efficient storage and retrieval of data using hashed keys. Hash functions are susceptible to undesirable collisions. To design or choose an appropriate hash function for an application, it is essential to estimate the probabilities with which these collisions can occur. In this paper we consider two problems: one of ...

We will investigate scalable algorithms for automated Semantic Web Service Composition (WSC). Our notion of WSC is very general: it allows the generation of new constants by Web service outputs; the composition semantics includes powerful background ontologies; and we use the most general notion of matching, partial matches, where several services can cooperate each covering only a part of a re...