Lie patterns in search procedures
β Scribed by Andrzej Pelc
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 566 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit
The current explosion of stored information necessitates a new model of pattern matching, that of compressed matching. In this model one tries to find all occurrences of a pattern in a compressed text in time proportional to the compressed text size, i.e., without decompressing the text. The most ef
A parametric approach fits particular classes of parametric models to the data, uses the model parameter estimates as summaries and tests for differences between groups by comparing fits with and without the assumption of common parameter values across groups. The paper discusses how a parametric ap