Sciweavers

10156 search results - page 162 / 2032
» Step by Step to Histories
Sort
View
204
Voted
LPAR
2010
Springer
15 years 5 months ago
Infinite Families of Finite String Rewriting Systems and Their Confluence
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
Jean-Pierre Jouannaud, Benjamin Monate
ICIP
2009
IEEE
15 years 4 months ago
Simplification of color images using semi-flat morphological operators and statistical metrics
The aim of this study is to propose an algorithm for simplifying color images. The assumption is made that a set of reference colors is available and that this set indicates which...
Arnaud Garcia, Corinne Vachier
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
15 years 2 months ago
Aggregation-based model reduction of a Hidden Markov Model
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
MOC
2010
15 years 1 months ago
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
Ren-Cang Li
NC
2011
219views Neural Networks» more  NC 2011»
14 years 10 months ago
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct ...
Paolo Bottoni, Anna Labella, Florin Manea, Victor ...