9842 search results - page 1504 / 1969 » Compositional timing analysis |
161
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
177
Voted
STOC
2005
ACM
16 years 6 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. ...
151
click to vote
STOC
2005
ACM
16 years 6 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...
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
262
click to vote
VLDB
2009
ACM
16 years 6 months ago
2009
ACM
Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broad...