4355 search results - page 34 / 871 » Increasing Kolmogorov Complexity |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
IWIA
2006
IEEE
14 years 2 months ago
2006
IEEE
Zero-day attacks, new (anomalous) attacks exploiting previously unknown system vulnerabilities, are a serious threat. Defending against them is no easy task, however. Having ident...
COCOON
1999
Springer
14 years 28 days ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
ALT
1997
Springer
14 years 24 days ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...