Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
: We describe the design and analysis of timeline visualizations for displaying the results of queries on an index of personal content. The visualization was built on top of a pers...
Meredith Ringel, Edward Cutrell, Susan T. Dumais, ...
Peer-to-peer networks have been identified as promising architectural concept for developing search scenarios across digital library collections. Digital libraries typically offer ...
Ivana Podnar, Toan Luu, Martin Rajman, Fabius Klem...
This paper presents the participation of FEUP, from University of Porto, in the TREC 2008 Blog Track. FEUP participated in two tasks, the baseline adhoc retrieval task and the blo...
Query-independent features (also called document priors), such as the number of incoming links to a document, its Page-Rank, or the type of its associated URL, have been successfu...