539 search results - page 88 / 108 » An Improved Upper Bound for SAT |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
GC
2008
Springer
13 years 9 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
PR
2008
13 years 9 months ago
2008
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
JMM2
2007
13 years 8 months ago
2007
Abstract— In this paper, we present a framework for multiterminal video compression (MTVC) that exploits the geometric constraints between cameras with overlapping fields of vie...
SIGDIAL
2010
13 years 6 months ago
2010
This paper proposes a novel approach for predicting user satisfaction transitions during a dialogue only from the ratings given to entire dialogues, with the aim of reducing the c...