Sciweavers

11212 search results - page 31 / 2243
» Semi-persistent Data Structures
Sort
View
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 7 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
COCOON
1998
Springer
13 years 11 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
IEEEPACT
2009
IEEE
13 years 5 months ago
Region Based Structure Layout Optimization by Selective Data Copying
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
Sandya S. Mannarswamy, Ramaswamy Govindarajan, Ris...
NAR
2006
61views more  NAR 2006»
13 years 7 months ago
E-MSD: improving data deposition and structure quality
The Macromolecular Structure Database (MSD) (http://www.ebi.ac.uk/msd/) [H. Boutselakis, D. Dimitropoulos, J. Fillon, A. Golovin, K. Henrick, A. Hussain, J. Ionides, M. John, P. A...
Mohammed Tagari, John G. Tate, G. J. Swaminathan, ...
CIDR
2009
148views Algorithms» more  CIDR 2009»
13 years 8 months ago
The Case for a Structured Approach to Managing Unstructured Data
The challenge of managing unstructured data represents perhaps the largest data management opportunity for our community since managing relational data. And yet we are risking let...
AnHai Doan, Jeffrey F. Naughton, Akanksha Baid, Xi...