Sciweavers

509 search results - page 60 / 102
» Preserving Properties Under Change
Sort
View
ESORICS
2005
Springer
14 years 2 months ago
Quantifying Probabilistic Information Flow in Computational Reactive Systems
Information flow and non-interference are well-established techniques for expressing both integrity and privacy properties. Because of the enormous potential to transmit informati...
Michael Backes
CIE
2006
Springer
14 years 12 days ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
FOIKS
2008
Springer
13 years 10 months ago
Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria
Abstract. This paper analyzes the aggregation of different abstract attack relations over a common set of arguments. Each of those attack relations can be considered as the represe...
Fernando A. Tohmé, Gustavo Adrian Bodanza, ...
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 10 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
AAAI
1990
13 years 9 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer