8132 search results - page 1283 / 1627 » Dependability, Abstraction, and Programming |
180
click to vote
FCT
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
180
click to vote
FPL
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Hardware realization of kernel loops holds the promise of accelerating the overall application performance and is therefore an important part of the synthesis process. In...
190
click to vote
ICTCS
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
165
click to vote
IPSN
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
185
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...