15033 search results - page 349 / 3007 » Complexity Theory and Algorithms |
175
click to vote
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
195
click to vote
CISSE
2008
Springer
15 years 8 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
206
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
208
click to vote
IANDC
2006
15 years 7 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
172
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...