Sciweavers

74 search results - page 14 / 15
» Optimal robust expensive optimization is tractable
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 10 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
DALT
2008
Springer
13 years 9 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
CSL
2010
Springer
13 years 7 months ago
Bayesian update of dialogue state: A POMDP framework for spoken dialogue systems
This paper describes a statistically motivated framework for performing real-time dialogue state updates and policy learning in a spoken dialogue system. The framework is based on...
Blaise Thomson, Steve Young
BTW
2007
Springer
154views Database» more  BTW 2007»
14 years 1 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 7 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...