Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
206
The Weighted Factors Automaton: A Tool for DNA Sequences Analysis
"... 20 avenue des Buttes de Coesmes ..."
Weighted automata and weighted logics
- In Automata, Languages and Programming – 32nd International Colloquium, ICALP 2005
, 2005
"... Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour of such an automaton is a mapping, called a formal power series, assigning to each word a weight in some semiring. We g ..."
Abstract
-
Cited by 55 (9 self)
- Add to MetaCart
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour of such an automaton is a mapping, called a formal power series, assigning to each word a weight in some semiring. We
OpenNWA: A Nested-Word-Automaton Library
"... Abstract. Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, such as parenthesis matching, yet retain all the desirable closure characteristics of finite-state automata. Th ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
. This paper describes OpenNWA, a C++ library for working with NWAs. The library provides the expected automata-theoretic operations, such as intersection, determinization, and complementation. It is packaged with WALi—the W eighted Automaton Library—and interoperates closely with the weighted pushdown system
On the Basic Parameters of Automaton-Based Image Compression
, 1999
"... This paper examines the theory behind the application of weighted finite automata as a data compression method for digital images. The weighted finite automaton model (WFA) was first proposed and studied in this connection by Culik and Kari in a series of papers. See [?, ?]. These investigators have ..."
Abstract
- Add to MetaCart
This paper examines the theory behind the application of weighted finite automata as a data compression method for digital images. The weighted finite automaton model (WFA) was first proposed and studied in this connection by Culik and Kari in a series of papers. See [?, ?]. These investigators
On the Determinizability of Weighted Automata and Transducers
- In Proceedings of the workshop Weighted Automata: Theory and Applications (WATA
, 2002
"... Finite automata are classical computational devices used in a variety of large-scale applications [1]. Finite-state transducers are automata whose transitions are labeled with both an input and an output label. Some applications in text, speech and image processing require more general devices, weig ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
, weighted automata, to account for the variability of the input data and to rank various output hypotheses [7, 9, 8]. A weighted automaton is a finite automaton in which each transition is labeled with some weight in addition to the usual symbol. Weighted automata and transducers provide a common
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- THEORET. COMPUT. SCI
, 2004
"... Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. Furthermore, the proof is constructive. A collection of examples is given to illu ..."
Abstract
-
Cited by 11 (3 self)
- Add to MetaCart
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. Furthermore, the proof is constructive. A collection of examples is given
Semiring artificial neural networks and weighted automata – and an application to digital image encoding
- In Proceedings of the 27th German Conference on Artificial Intelligence
, 2004
"... Abstract. In their seminal paper [1] McCulloch and Pitts have shown the strong relationship between finite automata and so-called McCulloch-Pitts networks. Our goal is to extend this result to weighted automata. In other words, we want to integrate artificial neural networks and weighted automata. F ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
. For this task, we introduce semiring artificial neural networks, that is, artificial neural networks which implement the addition and the multiplication of semirings. We present a construction of a semiring artificial neural network from a given weighted automaton, and back again. After that, we show how we can
Semiring Articial Neural Networks and Weighted Automata And an Application to Digital Image Encoding
"... Abstract. In their seminal paper [1] McCulloch and Pitts have shown the strong relationship between nite automata and so-called McCulloch-Pitts networks. Our goal is to extend this result to weighted automata. In other words, we want to integrate articial neural networks and weighted automata. For t ..."
Abstract
- Add to MetaCart
. For this task, we introduce semiring articial neural networks, that is, articial neural networks which implement the addition and the multiplication of semirings. We present a construction of a semiring arti-cial neural network from a given weighted automaton, and back again. After that, we show how we can
Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
, 2006
"... Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring e#cient #-transi- tions-removal techniques. In this paper, we present new bounds on the number of new transitions ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring e#cient #-transi- tions-removal techniques. In this paper, we present new bounds on the number of new
Quadratic weighted automata: Spectral algorithm and likelihood maximization
- Journal of Machine Learning Research
"... In this paper, we address the problem of non-parametric density estimation on a set of strings Σ∗. We introduce a probabilistic model – called quadratic weighted automaton, or QWA – and we present some methods which can be used in a density estimation task. A spectral analysis method leads to an eff ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
In this paper, we address the problem of non-parametric density estimation on a set of strings Σ∗. We introduce a probabilistic model – called quadratic weighted automaton, or QWA – and we present some methods which can be used in a density estimation task. A spectral analysis method leads
Results 11 - 20
of
206
