Sciweavers

3652 search results - page 53 / 731
» A study of query length
Sort
View
JDA
2008
72views more  JDA 2008»
13 years 7 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
SIGIR
2010
ACM
13 years 11 months ago
Studying trailfinding algorithms for enhanced web search
Search engines return ranked lists of Web pages in response to queries. These pages are starting points for post-query navigation, but may be insufficient for search tasks involvi...
Adish Singla, Ryen White, Jeff Huang
AIMSA
2008
Springer
14 years 2 months ago
Thematic Segment Retrieval Revisited
Documents, especially long ones, may contain very diverse passages related to different topics. Passages Retrieval approaches have shown that, in most cases, there is a great pote...
Sylvain Lamprier, Tassadit Amghar, Bernard Levrat,...
PODS
2004
ACM
115views Database» more  PODS 2004»
14 years 8 months ago
Foundations of Semantic Web Databases
The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework ...
Claudio Gutiérrez, Carlos A. Hurtado, Alber...
SIGIR
2004
ACM
14 years 1 months ago
Hourly analysis of a very large topically categorized web query log
We review a query log of hundreds of millions of queries that constitute the total query traffic for an entire week of a generalpurpose commercial web search service. Previously, ...
Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury...