CORR
2012
Springer
12 years 20 days ago
2012
Springer
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...
NAACL
2001
13 years 6 months ago
2001
Developing dialogue systems is a complex process. In particular, designing efficient dialogue management strategies is often difficult as there are no precise guidelines to develo...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
CIA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
ENTER
2009
Springer
13 years 11 months ago
2009
Springer
Conversational recommender systems support human-computer interaction strategies in order to assist online tourists in the important activity of dynamic packaging, i.e., in buildi...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...