Sciweavers

142 search results - page 14 / 29
» On the Construction of (Explicit) Khodak's Code and Its Anal...
Sort
View
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 1 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
CODES
2007
IEEE
14 years 1 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
BMCBI
2011
13 years 2 months ago
Multivariate analysis of microarray data: differential expression and differential connection
Background: Typical analysis of microarray data ignores the correlation between gene expression values. In this paper we present a model for microarray data which specifically all...
Harri T. Kiiveri
ICSM
2005
IEEE
14 years 1 months ago
Using Pointcut Delta Analysis to Support Evolution of Aspect-Oriented Software
Aspect oriented programming has been proposed as a way to improve modularity of software systems by allowing encapsulation of cross-cutting concerns. To do so, aspects specify whe...
Maximilian Störzer, Jürgen Graf