Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In order to precisely meet users' search concerns, we study how to effectively r...
Zhifeng Bao, Jiaheng Lu, Tok Wang Ling, Liang Xu, ...
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
Abstract. The natural and surrogate key architectures are two competing approaches to specifying keys in relational databases. We analyze the performance of these approaches with r...
Slavica Aleksic, Milan Celikovic, Sebastian Link, ...
The environments in which ambient agents are used often may be described by dynamical models, for example in the form of a set of differential equations. In this paper an ambient a...
Microarray data usually contains a high level of noisy gene data, the noisy gene data include incorrect, noise and irrelevant genes. Before Microarray data classification takes pla...
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
Flavio Ferrarotti, Sven Hartmann, Sebastian Link, ...
Recently, there has been much research into the specification of dynamic labeling schemes supporting XML updates. The primary design goal of any dynamic labeling scheme is to limi...