11212 search results - page 278 / 2243 » Semi-persistent Data Structures |
186
click to vote
SI3D
2009
ACM
16 years 1 months ago
2009
ACM
Given a data layout of a large walkthrough scene, we present a novel and simple spatial hierarchy on the disk-pages of the layout that has notable advantages over a conventional s...
186
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
148
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
287
click to vote
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
Signatures detect changes to the data objects. Numerous schemes a known, e.g., the popular hash based SHA-1 standard. We propose a nov scheme we call algebraic signatures. We use ...
195
click to vote
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...