{"title":"Content identification","authors":"Y. Yacobi","doi":"10.1145/1456520.1456521","DOIUrl":null,"url":null,"abstract":"Content identification can help link content to its legal creators. How robust can content identification become? In part-I of the talk we speculate about its asymptotic computational complexity (joint with Kivanc M. Mihcak), and in part-II we discuss the economics of such systems (joint with Gideon Yaniv; see full paper in this proceeding).","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Digital Rights Management Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1456520.1456521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Content identification can help link content to its legal creators. How robust can content identification become? In part-I of the talk we speculate about its asymptotic computational complexity (joint with Kivanc M. Mihcak), and in part-II we discuss the economics of such systems (joint with Gideon Yaniv; see full paper in this proceeding).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
