15 search results - page 2 / 3 » spire 2004 |
VAST
2004
ACM
13 years 11 months ago
2004
ACM
SPIRE
2004
Springer
13 years 11 months ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
SPIRE
2004
Springer
13 years 11 months ago
2004
Springer
To date, attempts for applying syntactic information in the document-based retrieval model dominant have led to little practical improvement, mainly due to the problems associated ...
SPIRE
2004
Springer
13 years 11 months ago
2004
Springer
The prediction of query performance is an interesting and important issue in Information Retrieval (IR). Current predictors involve the use of relevance scores, which are time-cons...
SPIRE
2004
Springer
13 years 11 months ago
2004
Springer
In the area of Text Retrieval, processing a query in the vector model has been verified to be qualitatively more effective than searching in the boolean model. However, in case o...