70 search results - page 6 / 14 » icalp 2007 |
212
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
178
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
143
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...
164
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
151
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...