: Search technology can be applied to many applications and is in the heart of always growing information society. A promising new development is the use of ontologies to enable se...
Felix Burkhardt, Jon Atle Gulla, Jin Liu, Christia...
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
Jie Cheng, Russell Greiner, Jonathan Kelly, David ...
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...
Michael Mrissa, Philippe Thiran, Jean-Marie Jacque...