837 research outputs found

    A Year Like No Other

    Get PDF
    Animated short film that I scored from a Director in LA.https://remix.berklee.edu/graduate-studies-scoring/1164/thumbnail.jp

    Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space

    Get PDF

    An Image Model based on Occluding Object Images and Maximum Entropy

    Get PDF
    This Paper Introduces a Statistical Image Model based on Occlusion and Maximum Entropy. the Statistical Model Combines a Fundamental Property of Image Formation, Occlusion, with Both Object-Image Shape and Nonuniform Object-Image Intensity. the Model is a Composition of Individual Object-Images that Have Random Positions, Shapes, and Intensities, and that Occlude Both Background and One Another. We Derive the Autocorrelation and Second-Order Probability Density Functions of This Model and Give Several Examples. © 1998 IEEE

    Structural Pattern Matching - Succinctly

    Get PDF
    Let T be a text of length n containing characters from an alphabet Sigma, which is the union of two disjoint sets: Sigma_s containing static characters (s-characters) and Sigma_p containing parameterized characters (p-characters). Each character in Sigma_p has an associated complementary character from Sigma_p. A pattern P (also over Sigma) matches an equal-length substring SS of T iff the s-characters match exactly, there exists a one-to-one function that renames the p-characters in S to the p-characters in P, and if a p-character x is renamed to another p-character y then the complement of x is renamed to the complement of y. The task is to find the starting positions (occurrences) of all such substrings S. Previous indexing solution [Shibuya, SWAT 2000], known as Structural Suffix Tree, requires Theta(nlog n) bits of space, and can find all occ occurrences in time O(|P|log sigma+ occ), where sigma = |Sigma|. In this paper, we present the first succinct index for this problem, which occupies n log sigma + O(n) bits and offers O(|P|logsigma+ occcdot log n logsigma) query time
    • …
    corecore