Sciweavers

4934 search results - page 152 / 987
» complexity 2008
Sort
View
CIE
2008
Springer
15 years 6 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
BMCBI
2008
110views more  BMCBI 2008»
15 years 4 months ago
Finding microRNA regulatory modules in human genome using rule induction
Background: MicroRNAs (miRNAs) are a class of small non-coding RNA molecules (20
Dang Hung Tran, Kenji Satou, Tu Bao Ho
COMPLEXITY
2008
84views more  COMPLEXITY 2008»
15 years 4 months ago
Evolutionary learning of small networks
Results are presented of a simulation which mimics an evolutionary learning process for small networks. Special features of these networks include a high recurrency, a transition ...
Thomas Filk, Albrecht von Müller
AGI
2008
15 years 5 months ago
Learning from Inconsistencies in an Integrated Cognitive Architecture
Whereas symbol
Kai-Uwe Kühnberger, Peter Geibel, Helmar Gust...
FUIN
2008
108views more  FUIN 2008»
15 years 4 months ago
A Simple Proof of Miller-Yu Theorem
A few years ago a nice criterion of Martin-L
Laurent Bienvenu, Wolfgang Merkle, Alexander Shen