1399 search results - page 132 / 280 » Multi-party Finite Computations |
123
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this ch...
154
click to vote
WSC
2008
15 years 6 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
115
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
133
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...