Sciweavers

16883 search results - page 3328 / 3377
» Generalized Non-Reducible Descriptors
Sort
View
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 5 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...
SIGIR
2008
ACM
15 years 5 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...
SIGIR
2008
ACM
15 years 5 months ago
SpotSigs: robust and efficient near duplicate detection in large web collections
Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching sig...
Martin Theobald, Jonathan Siddharth, Andreas Paepc...
SIGIR
2008
ACM
15 years 5 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
SIGIR
2008
ACM
15 years 5 months ago
A user browsing model to predict search engine click data from past observations
Search engine click logs provide an invaluable source of relevance information but this information is biased because we ignore which documents from the result list the users have...
Georges Dupret, Benjamin Piwowarski
« Prev « First page 3328 / 3377 Last » Next »