Sciweavers

61 search results - page 9 / 13
» A chain theorem for matroids
Sort
View
KBSE
1997
IEEE
15 years 3 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 5 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
15 years 5 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
14 years 11 months ago
Cubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...
Sergei Ovchinnikov
IJBC
2010
116views more  IJBC 2010»
14 years 9 months ago
Recurrence Plots for Symbolic Sequences
This paper introduces an extension of recurrence analysis to symbolic sequences. Heuristic arguments based on Shannon-McMillan-Breiman theorem suggest several relations between th...
Philippe Faure, Annick Lesne