Sciweavers

779 search results - page 56 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
14 years 8 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
GIS
2009
ACM
14 years 2 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
CoPub Mapper: mining MEDLINE based on search term co-publication
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...
Blaise T. F. Alako, Antoine Veldhoven, Sjozef van ...
SIGIR
2010
ACM
13 years 11 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
APCCM
2004
13 years 9 months ago
An Adaptive Information Retrieval System Based on Associative Networks
In this paper we present a multilingual information retrieval system that provides access to Tourism information by exploiting the intuitiveness of natural language. In particular...
Helmut Berger, Michael Dittenbach, Dieter Merkl