574 search results - page 96 / 115 » Beyond Search: Content Applications |
SIGIR
2004
ACM
14 years 1 months ago
2004
ACM
In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that th...
IPTPS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract— Content sharing is a popular usage of peerto-peer systems for its inherent scalability and low cost of maintenance. In this paper, we leverage this nature of peer-to-pe...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
String comparison is a critical issue in many application domains, including speech recognition, contents search, and bioinformatics. The similarity between two strings of lengths...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
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...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...