Sciweavers

478 search results - page 31 / 96
» Monads of Regular Theories
Sort
View
ICIP
2000
IEEE
16 years 16 days ago
Complexity-Regularized Denoising of Poisson-Corrupted Data
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...
Juan Liu, Pierre Moulin
FCT
2007
Springer
15 years 5 months ago
On Notions of Regularity for Data Languages
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Henrik Björklund, Thomas Schwentick
STACS
2001
Springer
15 years 3 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
GC
2010
Springer
14 years 9 months ago
Intriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
Bart De Bruyn, Hiroshi Suzuki
TACS
2001
Springer
15 years 3 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz