41 search results - page 4 / 9 » On extracting common random bits from correlated sources |
ASPDAC
2008
ACM
13 years 8 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
BMCBI
2006
13 years 7 months ago
2006
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
IWPC
2008
IEEE
14 years 2 months ago
2008
IEEE
The research examines the version histories of nine open source software systems to uncover trends and characteristics of how developers commit source code to version control syst...