The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
In this document, we describe a light-weighted ontology mediation method that allows users to send semantic queries to distant data repositories to browse for learning object meta...
Term-based representations of documents have found widespread use in information retrieval. However, one of the main shortcomings of such methods is that they largely disregard le...
Visual search connects physical (offline) objects with (online) digital media. Using objects from the environment, like newspapers, magazines, books and posters, we can retrieve s...
Jamey Graham, Jorge Moraleda, Jonathan J. Hull, Ti...
In companies a large amount of information is maintained that is accessible via network communication tools. This makes searching for a particular piece of information a di cult t...
Patrick Lambrix, Nahid Shahmehri, Niclas Wahll&oum...