| B. Subramanian, PhD Thesis Proposal, Technical report, CS-94-47, Brown University , December 1994. |
....Figure 4.6 shows the results of running our breaking program on a sequence, where the program calculates the approximating regression line of each resulting subsequence. 3. An index structure that supports pattern matching (such as Trie [Fr60] Position Tree [AHU74] or the one described in [Su94]) is maintained on the positiveness of the functions slopes. For a fixed small number OE, there are 3 possible index values: OE (slope OE) GammaOE (slope GammaOE) or 0 (slope is between GammaOE and OE) We take OE = 0:3. For example, given the sequence ....
B. Subramanian, PhD Thesis Proposal, Technical report, CS-94-47, Brown University , December 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC