10608 search results - page 219 / 2122 » Complexity of O'Hara's Algorithm |
100
Voted
ECOOP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
106
Voted
EUROCOLT
1995
Springer
15 years 4 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...
DLT
2006
15 years 1 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 ...
123
Voted
WSCG
2003
15 years 1 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...
130
click to vote
ALT
2010
Springer
15 years 18 days 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...