2996 search results - page 269 / 600 » Numberings and Randomness |
174
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
185
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
191
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
176
click to vote
ASE
2010
15 years 6 months ago
2010
There exists a large and growing number of proposed estimation methods but little conclusive evidence ranking one method over another. Prior effort estimation studies suffered fro...
210
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...