Sciweavers

4212 search results - page 48 / 843
» On Compressible Pairings and Their Computation
Sort
View
96
Voted
EUROCRYPT
2007
Springer
15 years 6 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
SAC
2011
ACM
14 years 3 months ago
ImageAlert: credibility analysis of text-image pairs on the web
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
Yusuke Yamamoto, Katsumi Tanaka
EDBT
2008
ACM
177views Database» more  EDBT 2008»
16 years 20 days ago
Fast computing reachability labelings for large graphs with high compression rate
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
63
Voted
ICIP
2009
IEEE
14 years 10 months ago
Better computer vision under video compression, an example using mean shift tracking
Salman Aslam, Aaron F. Bobick, Christopher F. Barn...