Sciweavers

685 search results - page 23 / 137
» Personalized Queries under a Generalized Preference Model
Sort
View
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
ICANN
2009
Springer
14 years 9 days ago
Learning from Examples to Generalize over Pose and Illumination
We present a neural system that recognizes faces under strong variations in pose and illumination. The generalization is learnt completely on the basis of examples of a subset of p...
Marco K. Müller, Rolf P. Würtz
CIKM
2005
Springer
14 years 1 months ago
Structured queries in XML retrieval
Document-centric XML is a mixture of text and structure. With the increased availability of document-centric XML content comes a need for query facilities in which both structural...
Jaap Kamps, Maarten Marx, Maarten de Rijke, Bö...
CIKM
2007
Springer
13 years 11 months ago
Web search personalization with ontological user profiles
Every user has a distinct background and a specific goal when searching for information on the Web. The goal of Web search personalization is to tailor search results to a particu...
Ahu Sieg, Bamshad Mobasher, Robin D. Burke
SIGIR
2008
ACM
13 years 7 months ago
Task-aware search personalization
Search personalization has been pursued in many ways, in order to provide better result rankings and better overall search experience to individual users [5]. However, blindly app...
Julia Luxenburger, Shady Elbassuoni, Gerhard Weiku...