Sciweavers

995 search results - page 43 / 199
» complexity 2011
Sort
View
IACR
2011
116views more  IACR 2011»
14 years 2 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
143
Voted
ATAL
2011
Springer
14 years 2 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
139
Voted
IACR
2011
135views more  IACR 2011»
14 years 2 months ago
Charm: A framework for Rapidly Prototyping Cryptosystems
We describe Charm, an extensible framework designed for rapid prototyping of cryptographic systems that utilize the latest advances in cryptography, such as identity and attribute...
Joseph A. Akinyele, Matthew Green, Aviel D. Rubin
130
Voted
TSP
2011
170views more  TSP 2011»
14 years 9 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
148
Voted
FOSSACS
2011
Springer
14 years 6 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi