All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Minimal Quadtree Format for Compression of Sparse Matrices Storage

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F12%3A00202208" target="_blank" >RIV/68407700:21240/12:00202208 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/SYNASC.2012.30" target="_blank" >http://dx.doi.org/10.1109/SYNASC.2012.30</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/SYNASC.2012.30" target="_blank" >10.1109/SYNASC.2012.30</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Minimal Quadtree Format for Compression of Sparse Matrices Storage

  • Original language description

    Computations with sparse matrices are widespread in scientific projects. Commonly used storage formats (such as COO or CSR) are not suitable for I/O file operations with sparse matrices due to their high space complexities. Memory-efficient formats are still under development. In this paper, we present a new storage format called the Minimal quadtree (MQ) as well as algorithms for converting matrices from common storage formats to the MQ format. We compare the space complexity of common storage formatsand of the MQ format and prove that the idea of using the quadtree as the data structure for sparse matrices is viable.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F12%2F2011" target="_blank" >GAP202/12/2011: Parallel Input/Output Algorithms for Very Large Sparse Matrices</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2012)

  • ISBN

    978-0-7695-4934-7

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    359-364

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos

  • Event location

    Timisoara

  • Event date

    Sep 26, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article