1802 search results - page 245 / 361 » Complexity Theory for Operators in Analysis |
242
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
153
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...
161
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...
158
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
177
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...