911 search results - page 45 / 183 » Kolmogorov Complexity Cores |
158
click to vote
DCC
2006
IEEE
16 years 5 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...
147
click to vote
ICDM
2009
IEEE
16 years 24 days 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...
199
click to vote
IWIA
2006
IEEE
16 years 4 days 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...
161
click to vote
EMMCVPR
2001
Springer
15 years 10 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
155
click to vote
COCOON
1999
Springer
15 years 10 months 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...