SIGN IN
SIGN UP
Interactive regret minimization
Full Text:
PDF
Buy this Article
Authors:
Danupon Nanongkai
University of Vienna, Vienna, Austria
Ashwin Lall
Denison University, Granville, OH, USA
Atish Das Sarma
Google Research, Mountain View, CA, USA
Kazuhisa Makino
University of Tokyo, Tokyo, Japan
2012 Article
Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 277
· Downloads (cumulative): 299
· Citation Count: 0
Published in:
· Proceeding
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Pages 109-120
ACM
New York, NY
, USA
©2012
table of contents
ISBN: 978-1-4503-1247-9
doi>
10.1145/2213836.2213850
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
query processing
regret minimization
skyline
theory
top-k
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder