18 search results - page 1 / 4 » Partially Persistent Search Trees with Transcript Operations |
STACS
1998
Springer
13 years 9 months ago
1998
Springer
ISMIR
2005
Springer
13 years 10 months ago
2005
Springer
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...
FAW
2008
Springer
13 years 7 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
JFP
2006
13 years 5 months ago
2006
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
IFL
1997
Springer
13 years 9 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...