Sciweavers

2830 search results - page 15 / 566
» No Science without Semantics
Sort
View
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz
JIS
2007
161views more  JIS 2007»
13 years 7 months ago
Is a knowledge society possible without freedom of access to information?
is.sagepub.com/cgi/content/abstract/33/4/387 The online version of this article can be found at: Published by: http://www.sagepublications.com On behalf of: Chartered Institute of ...
Peter Johan Lor, Johannes J. Britz
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
POVMs and Naimark's Theorem Without Sums
duce an abstract notion of POVM within the categorical quantum mechanical semantics in terms act categories. Our definition is justified by two facts: i. we provide a purely graph...
Bob Coecke, Éric Oliver Paquette
AOSD
2011
ACM
13 years 2 months ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden
SOFSEM
2009
Springer
14 years 4 months ago
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
Taolue Chen, Wan Fokkink, Rob J. van Glabbeek