Sciweavers

3228 search results - page 582 / 646
» Computationally Sound Proofs
Sort
View
FOCS
2007
IEEE
14 years 3 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
ICASSP
2007
IEEE
14 years 3 months ago
Evolutionary Sequence Modeling for Discovery of Peptide Hormones
There are currently a large number of ‘‘orphan’’ G-protein-coupled receptors (GPCRs) whose endogenous ligands (peptide hormones) are unknown. Identification of these pepti...
M. Kemal Sönmez, Lawrence Toll, Nina Zaveri
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 24 days ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
JAC
2008
13 years 10 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
FUNGAMES
2010
13 years 9 months ago
ajME: making game engines autonomic
Autonomic Computing is now showing its value as a solution to the increased complexities of maintaining computer systems and has been applied to many different fields. In this pap...
Pedro Martins, Julie A. McCann