Sciweavers

128 search results - page 7 / 26
» Performance and Cost Tradeoffs in Web Search.
Sort
View
TSP
2008
100views more  TSP 2008»
14 years 9 months ago
Optimal Two-Stage Search for Sparse Targets Using Convex Criteria
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
Eran Bashan, Raviv Raich, Alfred O. Hero III
62
Voted
DEXAW
2010
IEEE
150views Database» more  DEXAW 2010»
14 years 10 months ago
Search Strategies for Keyword-based Queries
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
Matthias Hagen, Benno Stein
KDD
2009
ACM
245views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining rich session context to improve web search
User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...
Guangyu Zhu, Gilad Mishne
ICDE
2008
IEEE
189views Database» more  ICDE 2008»
15 years 4 months ago
Adapting ranking functions to user preference
— Learning to rank has become a popular method for web search ranking. Traditionally, expert-judged examples are the major training resource for machine learned web ranking, whic...
Keke Chen, Ya Zhang, Zhaohui Zheng, Hongyuan Zha, ...
CIKM
2009
Springer
15 years 4 months ago
Applying differential privacy to search queries in a policy based interactive framework
Web search logs are of growing importance to researchers as they help understanding search behavior and search engine performance. However, search logs typically contain sensitive...
Palanivel Balaji Kodeswaran, Evelyne Viegas