Sciweavers

11784 search results - page 88 / 2357
» Interpolation for data structures
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
15 years 11 months ago
A quickstart in frequent structure mining can make a difference
Siegfried Nijssen, Joost N. Kok
ICSE
2005
IEEE-ACM
15 years 11 months ago
Data structure repair using goal-directed reasoning
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
Brian Demsky, Martin C. Rinard
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
15 years 18 days ago
Retroactive data structures
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...
Erik D. Demaine, John Iacono, Stefan Langerman
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
15 years 18 days ago
Making data structures confluently persistent
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...
Amos Fiat, Haim Kaplan
ESOP
2008
Springer
15 years 1 months ago
Semi-persistent Data Structures
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...
Sylvain Conchon, Jean-Christophe Filliâtre