We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more gene...
Toshizumi Fukui, Krzysztof Kurdyka, Laurentiu Paun...
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...