701 search results - page 44 / 141 » Kolmogorov complexity in perspective |
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
ICDM
2009
IEEE
14 years 2 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 1 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...
EMMCVPR
2001
Springer
14 years 5 days 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...
COCOON
1999
Springer
13 years 12 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...