Sciweavers

697 search results - page 10 / 140
» On the Theory of Average Case Complexity
Sort
View
EUROCRYPT
2001
Springer
14 years 7 days ago
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
Liam Keliher, Henk Meijer, Stafford E. Tavares
AI
2000
Springer
14 years 3 days ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu
INFOCOM
2010
IEEE
13 years 6 months ago
Towards a Theory of Anonymous Networking
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
Javad Ghaderi, Rayadurgam Srikant
IJCAI
2003
13 years 9 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
DESRIST
2009
Springer
143views Education» more  DESRIST 2009»
14 years 12 days ago
Designing for complex innovations in health care: design theory and realist evaluation combined
Innovations in health care are often characterized by complexity and fuzzy boundaries, involving both the elements of the innovation and the organizational structure required for ...
Christina Keller, Klas Gäre, Mats Edenius, St...