Sciweavers

11211 search results - page 11 / 2243
» Data Structures
Sort
View
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
15 years 10 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
ICALP
2004
Springer
15 years 11 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
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
15 years 10 months ago
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Y...
ESOP
2008
Springer
15 years 8 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
POPL
1998
ACM
15 years 10 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide