Sciweavers

400 search results - page 33 / 80
» Derandomization and Distinguishing Complexity
Sort
View
IACR
2011
116views more  IACR 2011»
14 years 1 months ago
Some Words About Cryptographic Key Recognition In Data Streams
Search for cryptographic keys in RAM is a new and prospective technology which can be used, primarily, in the computer forensics. In order to use it, a cryptanalyst must solve, at...
Alexey Chilikov, Evgeny Alekseev
TASE
2012
IEEE
13 years 9 months ago
Discrete-Event Coordination Design for Distributed Agents
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
Manh Tung Pham, Kiam Tian Seow
ECCB
2002
IEEE
15 years 7 months ago
Stochastic roadmap simulation for the study of ligand-protein interactions
The dynamics of ligand-protein interactions are necessary to understand for the design of novel therapeutic agents. In this paper, we establish the use of Stochastic Roadmap Simul...
Mehmet Serkan Apaydin, Carlos Guestrin, Chris Varm...
POPL
2009
ACM
16 years 2 months ago
Unifying type checking and property checking for low-level code
We present a unified approach to type checking and property checking for low-level code. Type checking for low-level code is challenging because type safety often depends on compl...
Jeremy Condit, Brian Hackett, Shuvendu K. Lahiri, ...
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
15 years 7 months ago
Testing Periodicity
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
Oded Lachish, Ilan Newman