11231 search results - page 33 / 2247 » Digging for Data Structures |
179
click to vote
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
Navier’s equations modelling linear elastic solid deformations are embedded within an Extended Kalman Filter (EKF) to compute a sequential Bayesian estimate for the Non-Rigid St...
103
click to vote
ESOP
2008
Springer
15 years 26 days 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...
108
click to vote
FOCS
1996
IEEE
15 years 3 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. ...
DBPL
1999
Springer
15 years 3 months ago
1999
Springer
Applications have an increasing need to manage semistructured data such as data encoded in XML along with conventional structured data. We extend the structured object database ...
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...