Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SODA

2008

ACM

2008

ACM

We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domain [n]d = {1, . . . , n}d . We would like to closely approximate f by a monotone function g. This should be done by a procedure (a filter) that given as input a point x [n]d outputs the value of g(x), and runs in time that is highly sublinear in n. The procedure can (indeed must) be randomized, but we require that all of the randomness be specified in advance by a single short random seed. We construct such an implementation where the the time and space per query is (log n)O(1) and the size of the seed is polynomial in log n and d. Furthermore the distance of the approximating function g from f is at most a constant multiple of the minimum distance of any monotone function from f. This implementation allows for parallelization: one can initialize many copies of the filter with the same short random seed, and ...

Related Content

Added |
30 Oct 2010 |

Updated |
30 Oct 2010 |

Type |
Conference |

Year |
2008 |

Where |
SODA |

Authors |
Michael E. Saks, C. Seshadhri |

Comments (0)