15073 search results - page 16 / 3015 » Probabilistic algorithms for computing resultants |
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
DASFAA
2007
IEEE
15 years 4 months ago
2007
IEEE
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...