Sciweavers

274 search results - page 23 / 55
» Weighted Automata and Weighted Logics
Sort
View
CONCUR
2003
Springer
14 years 22 days ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
STACS
2004
Springer
14 years 26 days ago
Desert Automata and the Finite Substitution Problem
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
Daniel Kirsten
CONCUR
2006
Springer
13 years 11 months ago
Probabilistic I/O Automata: Theories of Two Equivalences
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
IEEEMSP
2002
IEEE
167views Multimedia» more  IEEEMSP 2002»
14 years 13 days ago
An experimental study on the performance of visual information retrieval similarity models
–This paper is an experimental study on the performance of the two major methods for macro-level similarity measurement: linear weighted merging and logical retrieval. Performanc...
Horst Eidenberger, Christian Breiteneder
ALT
2010
Springer
13 years 4 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...