Sparse binary matrices

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F05%3A00012186" target="_blank" >RIV/61989100:27240/05:00012186 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Sparse binary matrices

Original language description

Many of these computations have matrix character. Although amount of memory in computers grows very rapidly, there are still matrices that are bigger than available memory. But many of these matrices are sparse, so that storage only non-zero values can solve the problem. Special case of sparse matrices are binary sparse matrices i.e. matrices where only binary values 0 and 1 are allowed. Large sparse binary matrices play important role in computer science, and in many modern information retrieval methods. These methods, such as clustering, web graph computations, web link analysis [6], binary factor analysis [7] performs huge number of computations with such matrices, thus their implementation should be very carefully designed.

Czech name

Sparse binary matrices

Czech description

Many of these computations have matrix character. Although amount of memory in computers grows very rapidly, there are still matrices that are bigger than available memory. But many of these matrices are sparse, so that storage only non-zero values can solve the problem. Special case of sparse matrices are binary sparse matrices i.e. matrices where only binary values 0 and 1 are allowed. Large sparse binary matrices play important role in computer science, and in many modern information retrieval methods. These methods, such as clustering, web graph computations, web link analysis [6], binary factor analysis [7] performs huge number of computations with such matrices, thus their implementation should be very carefully designed.

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GP201%2F05%2FP145" target="_blank" >GP201/05/P145: Special data compression methods</a><br>

Continuities

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

Publication year

2005

Confidentiality

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

Article name in the collection

ITAT 2005

ISBN

80-7097-609-8

ISSN

—

e-ISSN

—

Number of pages

14

Pages from-to

103-116

Publisher name

Univerzita P. J. Šafárika v Košiciach

Place of publication

Košice

Event location

Ráčkova Dolina

Event date

Sep 20, 2005

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

—