10988 search results - page 285 / 2198 » Algorithmic Folding Complexity |
133
click to vote
EUROCOLT
1995
Springer
15 years 8 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
125
click to vote
DLT
2006
15 years 5 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
158
click to vote
WSCG
2003
15 years 5 months ago
2003
The registration of 3D form features is essential to the supporting of reverse shape design processes. Extracting an editable shape feature from unordered data points is notorious...
164
click to vote
ALT
2010
Springer
15 years 4 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
133
click to vote
IS
2008
15 years 4 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...