Sciweavers

1450 search results - page 87 / 290
» On the Complexity of Hardness Amplification
Sort
View
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 3 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
SACRYPT
2007
Springer
167views Cryptology» more  SACRYPT 2007»
14 years 3 months ago
Cryptanalysis of White-Box DES Implementations with Arbitrary External Encodings
Abstract. At DRM 2002, Chow et al. [4] presented a method for implementing the DES block cipher such that it becomes hard to extract the embedded secret key in a white-box attack c...
Brecht Wyseur, Wil Michiels, Paul Gorissen, Bart P...
IEEEICCI
2005
IEEE
14 years 2 months ago
Toward the development of cognitive task difficulty metrics to support intelligence analysis research
Intelligence analysis is a cognitively complex task that is the subject of considerable research aimed at developing methods and tools to aid the analysis process. To support such...
Frank L. Greitzer
ICANN
2005
Springer
14 years 2 months ago
A Model for Delay Activity Without Recurrent Excitation
Delay activity (DA) is the increased firing rate of a cortical population, which persists when the stimulus that induced it is removed. It is believed to be the neural substrate f...
Marc de Kamps
LATA
2010
Springer
14 years 2 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau