Sciweavers

1469 search results - page 184 / 294
» Query Expansion and Query Reduction in Document Retrieval
Sort
View
SIGIR
2010
ACM
15 years 1 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
ICDAR
2003
IEEE
15 years 3 months ago
Information Retrieval Based Writer Identification
This communication deals with the Writer Identification task. Our previous work has shown the interest of using the graphemes as features for describing the individual properties ...
Ameur Bensefia, Thierry Paquet, Laurent Heutte
AINA
2007
IEEE
15 years 4 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
INFOCOM
2006
IEEE
15 years 4 months ago
SmartSeer: Using a DHT to Process Continuous Queries Over Peer-to-Peer Networks
— As the academic world moves away from physical journals and proceedings towards online document repositories, the ability to efficiently locate work of interest among the torr...
Jayanthkumar Kannan, Beverly Yang, Scott Shenker, ...
WWW
2008
ACM
15 years 10 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel