1889 search results - page 157 / 378 » Re-ranking search results using query logs |
83
Voted
WALCOM
2010
IEEE
15 years 7 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
130
Voted
PE
2008
Springer
15 years 20 days ago
2008
Springer
We develop a queueing model for analyzing resource replication strategies in wireless sensor networks. The model can be used to minimize either the total transmission rate of the ...
229
Voted
ICDE
2001
IEEE
16 years 2 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
120
Voted
BMCBI
2006
15 years 23 days ago
2006
Background: Many commonly used genome browsers display sequence annotations and related attributes as horizontal data tracks that can be toggled on and off according to user prefe...
164
click to vote
APVIS
2011
14 years 21 days ago
2011
NETSPEAK helps writers in choosing words while writing a text. It checks for the commonness of phrases and allows for the retrieval of alternatives by means of wildcard queries. T...