Sciweavers

1797 search results - page 77 / 360
» Regularized Winnow Methods
Sort
View
ADBIS
2000
Springer
106views Database» more  ADBIS 2000»
14 years 20 days ago
Using XML and Regular Expressions in the Syntactic Analysis of Inflectional Language
In this paper we describe an approach to representation of data and knowledge using two technologies: XML and regular expressions in a domain of natural language syntactic analysis...
Marek Trabalka, Mária Bieliková
FOSSACS
2008
Springer
13 years 10 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
IMAMS
2007
157views Mathematics» more  IMAMS 2007»
13 years 10 months ago
Regularity Criteria for the Topology of Algebraic Curves and Surfaces
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
Lionel Alberti, Bernard Mourrain
CSDA
2007
96views more  CSDA 2007»
13 years 9 months ago
On a quadratic eigenproblem occurring in regularized total least squares
In a recent paper Sima, Van Huffel and Golub [Regularized total least squares based on quadratic eigenvalue problem solvers. BIT Numerical Mathematics 44, 793 - 812 (2004)] sugges...
J. Lampe, H. Voss
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
13 years 9 months ago
Robust optimal control of regular languages
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
Constantino M. Lagoa, Jinbo Fu, Asok Ray