Sciweavers

11231 search results - page 33 / 2247
» Digging for Data Structures
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Finite Element based sequential Bayesian Non-Rigid Structure from Motion
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...
Antonio Agudo, Begoña Calvo, J. M. M. Monti...
ESOP
2008
Springer
13 years 10 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
FOCS
1996
IEEE
14 years 19 days ago
Fault Tolerant Data Structures
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. ...
Yonatan Aumann, Michael A. Bender
DBPL
1999
Springer
98views Database» more  DBPL 1999»
14 years 23 days ago
Ozone: Integrating Structured and Semistructured Data
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 ...
Tirthankar Lahiri, Serge Abiteboul, Jennifer Widom
ICALP
2004
Springer
14 years 1 months ago
A General Technique for Managing Strings in Comparison-Driven Data Structures
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,...
Gianni Franceschini, Roberto Grossi