Sciweavers

182 search results - page 5 / 37
» Some problems with the notion of context-aware computing
Sort
View
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
CSFW
1999
IEEE
13 years 11 months ago
Process Algebra and Non-Interference
The information security community has long debated the exact definition of the term `security'. Even if we focus on the more modest notion of confidentiality the precise def...
Peter Y. A. Ryan, Steve A. Schneider
COCOON
2007
Springer
14 years 1 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
DCC
2004
IEEE
14 years 7 months ago
Semi-Lossless Text Compression
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...
Yair Kaufman, Shmuel T. Klein
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 5 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis