15073 search results - page 111 / 3015 » Probabilistic algorithms for computing resultants |
134
click to vote
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
134
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image fea...
135
Voted
DSL
2009
15 years 1 months ago
2009
We propose a new focus in language design where languages provide constructs that not only describe the computation of results, but also produce explanations of how and why those r...
122
click to vote
JCSS
2006
15 years 3 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
131
Voted
COLT
1995
Springer
15 years 7 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...