Sciweavers

6045 search results - page 222 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
BMCBI
2010
121views more  BMCBI 2010»
13 years 5 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 2 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
CASES
2004
ACM
14 years 1 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
FOCS
2000
IEEE
14 years 21 days ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
IJAC
2002
128views more  IJAC 2002»
13 years 8 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki