Sciweavers

11231 search results - page 83 / 2247
» Digging for Data Structures
Sort
View
COCOON
1998
Springer
15 years 3 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...
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
15 years 11 months ago
Information-Theoretic Tools for Mining Database Structure from Large Data Sets
Periklis Andritsos, Renée J. Miller, Panayi...
NAR
2006
61views more  NAR 2006»
14 years 11 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, ...