Sciweavers

727 search results - page 37 / 146
» Private approximation of search problems
Sort
View
WINE
2007
Springer
151views Economy» more  WINE 2007»
14 years 4 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
WIDM
2006
ACM
14 years 4 months ago
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
Ronak Desai, Qi Yang, Zonghuan Wu, Weiyi Meng, Cle...
WINE
2007
Springer
124views Economy» more  WINE 2007»
14 years 4 months ago
Stochastic Models for Budget Optimization in Search-Based Advertising
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
S. Muthukrishnan, Martin Pál, Zoya Svitkina
DCC
2002
IEEE
14 years 9 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
14 years 3 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...