Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
This paper introduces the concept of spatial filters as an approach to increasing the relevance of the information retrieved by users of mobile information systems. This approach ...
Search Engines today often return a large volume of results with possibly a few relevant results. The notion of relevance is subjective and depends on the user and the context of ...
One important task of semantic web portals is to offer both end users and applications a seamless access to knowledge contained in heterogeneous data sources in specific user commu...