459 search results - page 59 / 92 » Computational Complexity of Probabilistic Disambiguation |
MDM
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
ARCS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
IMA
1995
Springer
15 years 3 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
101
click to vote
AAAI
2004
15 years 1 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
107
click to vote
AAAI
2006
15 years 1 months ago
2006
We examine a setting in which a buyer wishes to purchase probabilistic information from some agent. The seller must invest effort in order to gain access to the information, and m...