Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications requir...
We present a universal mechanism that can be combined with existing trust models to extend their capabilities towards efficient modelling of the situational (contextdependent) tr...
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Given a query on the PASCAL database maintained by the INIST, we design user interfaces to visualize and wo types of graphs extracted from abstracts: 1) the graph of all associati...
As the Semantic Web (SW) is being automatically populated with large number of RDF triples scalability issues related to wide scale reasoning occur. We believe these difficulties ...