On Two Segmentation Problems
- 31 October 1999
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 33 (1) , 173-184
- https://doi.org/10.1006/jagm.1999.1024
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Segmentation problemsJournal of the ACM, 2004
- A Chernoff Bound for Random Walks on Expander GraphsSIAM Journal on Computing, 1998
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- Dispersers, deterministic amplification, and weak random sourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- How to recycle random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- Eigenvalues and expandersCombinatorica, 1986
- Explicit expanders and the Ramanujan conjecturesPublished by Association for Computing Machinery (ACM) ,1986
- Explicit Concentrators from Generalized N-GonsSIAM Journal on Algebraic Discrete Methods, 1984