587 search results - page 58 / 118 » On the Relative Sizes of Learnable Sets |
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
PAM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Techniques for authenticating BGP protocol objects entail the inspection of additional information in the form of authentication credentials that can be used to validate ...
ICSE
2009
IEEE-ACM
14 years 1 months ago
2009
IEEE-ACM
The comprehensive understanding of today’s software systems is a daunting activity, because of the sheer size and complexity that such systems exhibit. Moreover, software system...
GFKL
2006
Springer
14 years 12 days ago
2006
Springer
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
KR
2000
Springer
14 years 9 days ago
2000
Springer
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...