Sciweavers

8768 search results - page 142 / 1754
» Generalizing the notion of support
Sort
View
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
WWW
2009
ACM
16 years 7 months ago
Evaluating similarity measures for emergent semantics of social tagging
Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question ...
Benjamin Markines, Ciro Cattuto, Filippo Menczer, ...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 7 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
ICFP
2005
ACM
16 years 7 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
ICFP
2004
ACM
16 years 7 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao