685 search results - page 80 / 137 » Personalized Queries under a Generalized Preference Model |
181
click to vote
WSDM
2012
ACM
13 years 10 months ago
2012
ACM
This paper uncovers a new phenomenon in web search that we call domain bias — a user’s propensity to believe that a page is more relevant just because it comes from a particul...
182
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
164
click to vote
MIR
2010
ACM
15 years 10 months ago
2010
ACM
Most video retrieval systems are multimodal, commonly relying on textual information, low- and high-level semantic features extracted from query visual examples. In this work, we ...
121
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
130
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...