2200 search results - page 144 / 440 » Bloch's Constant is Computable |
157
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
190
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...
206
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
164
click to vote
NIPS
2007
15 years 8 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
159
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...