2128 search results - page 139 / 426 » A general characterization of indulgence |
180
click to vote
ENTCS
2010
15 years 6 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
172
click to vote
ITA
2007
15 years 6 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
158
click to vote
TIT
2008
15 years 6 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
154
click to vote
ACTA
2000
15 years 6 months ago
2000
The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. T...
168
click to vote
NN
2000
Springer
15 years 6 months ago
2000
Springer
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...