Sciweavers

2436 search results - page 106 / 488
» Comonadic Notions of Computation
Sort
View
WWW
2011
ACM
14 years 11 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 7 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
AOSD
2012
ACM
13 years 11 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
120
Voted
FSE
2009
Springer
136views Cryptology» more  FSE 2009»
16 years 4 months ago
MAC Reforgeability
Message Authentication Codes (MACs) are core algorithms deployed in virtually every security protocol in common usage. In these protocols, the integrity and authenticity of messag...
John Black, Martin Cochran
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
16 years 4 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...