About: Sparse binary matrices

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Sparse binary matrices Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. 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. (en) 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. (cs)
Title	Sparse binary matrices Sparse binary matrices (en) Sparse binary matrices (cs)
skos:prefLabel	Sparse binary matrices Sparse binary matrices (en) Sparse binary matrices (cs)
skos:notation	RIV/61989100:27240/05:00012186!RIV06-GA0-27240___
http://linked.open.../vavai/riv/strany	103-116
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GP201/05/P145)
http://linked.open...vai/riv/dodaniDat	2006
http://linked.open...aciTvurceVysledku	Snášel, Václav Dvorský, Jiří Martinovič, Jan
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	543773
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/05:00012186
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	web link analysis [6]; binary factor analysis [7] performs huge number of computations (en)
http://linked.open.../riv/klicoveSlovo	binary factor analysis [7] performs huge number of computations web link analysis [6]
http://linked.open...ontrolniKodProRIV	[70F225A18E3B]
http://linked.open...v/mistoKonaniAkce	Ráčkova Dolina
http://linked.open...i/riv/mistoVydani	Košice
http://linked.open...i/riv/nazevZdroje	ITAT 2005
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Special data compression methods
http://linked.open...UplatneniVysledku	2005
http://linked.open...iv/tvurceVysledku	Dvorský, Jiří Martinovič, Jan Snášel, Václav
http://linked.open...vavai/riv/typAkce	CST - Celostátní
http://linked.open.../riv/zahajeniAkce	2005-09-20 (xsd:date)
number of pages	14 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Univerzita P. J. Šafárika v Košiciach
https://schema.org/isbn	80-7097-609-8
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software