Information-Aware 2^n-Tree for Efficient Out-Of-Core Indexing of Very Large Multidimensional Volumetric Data

doi 10.1109/ssdbm.2007.15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Data Locality Optimization for Synthesis of Efficient Out-Of-Core Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Summary Prefix Tree: An Over DHT Indexing Data Structure for Efficient Superset Search

2017English

Optimised Kd-Tree Indexing of Multimedia Data

2003English

Out-Of-Core Compression and Decompression of Large N-Dimensional Scalar Fields

Computer Graphics Forum
Computer NetworksComputer GraphicsComputer-Aided DesignCommunications
2003English

Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-Directed De Bruijn Graphs

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2010English

Implementation of X-Tree Structure for Multidimensional Data Ranking

International Journal of Computer Applications
2012English

Transfer Function-Guided Saliency-Aware Compression for Transmitting Volumetric Data

IEEE Transactions on Multimedia
Electronic EngineeringMedia TechnologyComputer Science ApplicationsElectricalSignal Processing
2017English

Automated Analysis of Large (>4Gb) Spectral Images With Efficient Out-Of-Core- RAM Algorithms

Microscopy and Microanalysis
Instrumentation
2003English

Multidimensional Scaling for Large Genomic Data Sets

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy