Sciweavers

167 search results - page 16 / 34
» A New Lower Bound for A(17, 6, 6)
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 8 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
VLDB
1997
ACM
66views Database» more  VLDB 1997»
14 years 3 days ago
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
Khaled Alsabti, Sanjay Ranka, Vineet Singh
TPDS
1998
92views more  TPDS 1998»
13 years 7 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
14 years 7 days ago
Random Number Generators Founded on Signal and Information Theory
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
David Paul Maher, Robert J. Rance
VLSID
2006
IEEE
169views VLSI» more  VLSID 2006»
14 years 1 months ago
A Low Leakage and SNM Free SRAM Cell Design in Deep Sub Micron CMOS Technology
As the IC process technology scales, the oxide thickness and operating voltage continues to decrease. The gate oxide thickness in recent and future IC process technology has appro...
Sanjeev K. Jain, Pankaj Agarwal