Sciweavers

28 search results - page 3 / 6
» Making data structures confluently persistent
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 9 months ago
Versioning Tree Structures by Path-Merging
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 ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...
POPL
2008
ACM
14 years 8 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
IMCSIT
2010
13 years 5 months ago
Trusted Data in IBM's MDM: Accuracy Dimension
A good data model designed for e-Commerce or e-Government has little value if it lacks accurate, up-to-date data [22]. In this paper data quality measures, its processing and maint...
Przemyslaw Pawluk
SIGOPS
2008
95views more  SIGOPS 2008»
13 years 7 months ago
Virtual machine time travel using continuous data protection and checkpointing
Virtual machine (VM) time travel enables reverting a virtual machine's state, both transient and persistent, to past points in time. This capability can be used to improve vi...
Paula Ta-Shma, Guy Laden, Muli Ben-Yehuda, Michael...