126 search results - page 12 / 26 » Storing a Compressed Function with Constant Time Access |
JFP
2006
13 years 7 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...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
Hierarchical culling is a key acceleration technique used to efficiently handle massive models for ray tracing, collision detection, etc. To support such hierarchical culling, bo...
IFL
1997
Springer
13 years 12 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...