6251 search results - page 304 / 1251 » Randomness, Computability, and Density |
190
click to vote
ICALP
2005
Springer
16 years 5 days ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
187
Voted
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
236
Voted
RECOMB
2001
Springer
16 years 7 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
214
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
203
click to vote
MSWIM
2005
ACM
16 years 6 days ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...