Sciweavers

1225 search results - page 93 / 245
» The Instance Complexity Conjecture
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 9 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
KI
2008
Springer
13 years 9 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
14 years 1 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
BMCBI
2006
98views more  BMCBI 2006»
13 years 9 months ago
Scanning sequences after Gibbs sampling to find multiple occurrences of functional elements
Background: Many DNA regulatory elements occur as multiple instances within a target promoter. Gibbs sampling programs for finding DNA regulatory elements de novo can be prohibiti...
Kannan Tharakaraman, Leonardo Mariño-Ram&ia...
NAR
2010
122views more  NAR 2010»
13 years 3 months ago
ELM: the status of the 2010 eukaryotic linear motif resource
Linear motifs are short segments of multidomain proteins that provide regulatory functions independently of protein tertiary structure. Much of intracellular signalling passes thr...
Cathryn M. Gould, Francesca Diella, Allegra Via, P...