Sciweavers

370 search results - page 24 / 74
» Bounded modified realizability
Sort
View
JIPS
2006
71views more  JIPS 2006»
13 years 8 months ago
Scenario-based 3D Objects Synthesizing System Design
: This paper proposes the framework of the scenario-based 3D image synthesizing system that allows common users who envision a scenario in their mind to realize it into the segment...
Ji-Seung Nam, Hui Gao, Mi-Young Kang, Kyoung-Tae K...
POPL
2008
ACM
14 years 9 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
AGI
2008
13 years 10 months ago
VARIAC: an Autogenous Cognitive Architecture
Learning theory and programs to date are inductively bounded: they can be described as "wind-up toys" which can only learn the kinds of things that their designers envisi...
J. Storrs Hall
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 8 months ago
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
M. A. Iwen
TIT
2010
121views Education» more  TIT 2010»
13 years 3 months ago
Power of a public random permutation and its application to authenticated encryption
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
Kaoru Kurosawa