10890 search results - page 1787 / 2178 » Automatic Complexity Analysis |
165
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
228
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
173
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
196
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
160
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...