Sciweavers

777 search results - page 71 / 156
» Optimization of Relational Preference Queries
Sort
View
WWW
2009
ACM
14 years 10 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 2 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
IJCAI
2003
13 years 11 months ago
Incremental Utility Elicitation with the Minimax Regret Decision Criterion
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
Tianhan Wang, Craig Boutilier
UAI
2003
13 years 11 months ago
Active Collaborative Filtering
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of onl...
Craig Boutilier, Richard S. Zemel, Benjamin M. Mar...
SEMWEB
2010
Springer
13 years 8 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet