Sciweavers

9370 search results - page 302 / 1874
» An Abstract Notion of Application
Sort
View
174
Voted
JSYML
2008
78views more  JSYML 2008»
15 years 7 months ago
Hierarchies of forcing axioms I
Abstract. We prove new upper bound theorems on the consistency strengths of SPFA(), SPFA(-linked) and SPFA(+ -cc). Our results are in terms of (, )-subcompactness, which is a new l...
Itay Neeman, Ernest Schimmerling
ENTCS
2007
174views more  ENTCS 2007»
15 years 7 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
ENTCS
2007
89views more  ENTCS 2007»
15 years 7 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
211
Voted
JUCS
2006
107views more  JUCS 2006»
15 years 7 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
AI
2005
Springer
15 years 7 months ago
SCC-recursiveness: a general schema for argumentation semantics
entation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general r...
Pietro Baroni, Massimiliano Giacomin, Giovanni Gui...