Sciweavers

1056 search results - page 107 / 212
» A Probabilistic Applied Pi-Calculus
Sort
View
QEST
2006
IEEE
14 years 3 months ago
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
Joost-Pieter Katoen, Ivan S. Zapreev
JSAI
2005
Springer
14 years 2 months ago
Learning Stochastic Logical Automaton
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
Hiroaki Watanabe, Stephen Muggleton
SLSFS
2005
Springer
14 years 2 months ago
Constructing Visual Models with a Latent Space Approach
We propose the use of latent space models applied to local invariant features for object classification. We investigate whether using latent space models enables to learn patterns...
Florent Monay, Pedro Quelhas, Daniel Gatica-Perez,...
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
14 years 2 months ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
HUC
2004
Springer
14 years 2 months ago
Particle Filters for Location Estimation in Ubiquitous Computing: A Case Study
Location estimation is an important part of many ubiquitous computing systems. Particle filters are simulation-based probabilistic approximations which the robotics community has ...
Jeffrey Hightower, Gaetano Borriello