Sciweavers

1242 search results - page 202 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
CCS
2006
ACM
15 years 1 months ago
On the modeling and analysis of obligations
Traditional security policies largely focus on access control requirements, which specify who can access what under what circumstances. Besides access control requirements, the av...
Keith Irwin, Ting Yu, William H. Winsborough
FPL
2004
Springer
100views Hardware» more  FPL 2004»
15 years 1 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...
WSC
2008
15 years 1 days ago
Modeling and simulation of e-mail social networks: A new stochastic agent-based approach
Understanding how the structure of a network evolves over time is one of the most interesting and complex topics in the field of social networks. In our attempt to model the dynam...
Fabian Menges, Bud Mishra, Giuseppe Narzisi
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
14 years 11 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
ICML
2010
IEEE
14 years 10 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein