Sciweavers

5153 search results - page 309 / 1031
» Introduction to Randomized Algorithms
Sort
View
112
Voted
RSA
2010
104views more  RSA 2010»
15 years 2 months ago
An approximation algorithm for counting contingency tables
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
Alexander I. Barvinok, Zur Luria, Alex Samorodnits...
141
Voted
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 8 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
DAMON
2008
Springer
15 years 5 months ago
Fast scans and joins using flash drives
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
Mehul A. Shah, Stavros Harizopoulos, Janet L. Wien...
ICCD
2004
IEEE
106views Hardware» more  ICCD 2004»
16 years 29 days ago
A New Statistical Optimization Algorithm for Gate Sizing
— In this paper, we approach the gate sizing problem in VLSI circuits in the context of increasing variability of process and circuit parameters as technology scales into the nan...
Murari Mani, Michael Orshansky
ICCS
2005
Springer
15 years 9 months ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...