11212 search results - page 6 / 2243 » Semi-persistent Data Structures |
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Most existing structure from motion (SFM) approaches for unordered images cannot handle multiple instances of the same structure in the scene. When image pairs containing differen...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
FOCS
1996
IEEE
13 years 11 months ago
1996
IEEE
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...