Sciweavers

11784 search results - page 126 / 2357
» Interpolation for data structures
Sort
View
FGCS
2007
107views more  FGCS 2007»
14 years 11 months ago
Algorithmic re-structuring and data replication for protein structure comparison on a GRID
This paper describes a major restructuring of PROuST, a method for protein structure comparison, for an efficient porting to the Grid. PROuST consists of different components: an...
Giovanni Ciriello, M. Comin, Concettina Guerra
ICIP
1999
IEEE
16 years 28 days ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
POPL
2008
ACM
15 years 11 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
CAV
2007
Springer
126views Hardware» more  CAV 2007»
15 years 5 months ago
Shape Analysis for Composite Data Structures
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
Josh Berdine, Cristiano Calcagno, Byron Cook, Dino...
ICSE
2010
IEEE-ACM
15 years 4 months ago
Dynamic symbolic data structure repair
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
Ishtiaque Hussain, Christoph Csallner