This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F05%3A00012186%21RIV06-GA0-27240___/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F05%3A00012186%21RIV06-GA0-27240___
rdf:type
n14:Vysledek skos:Concept
dcterms: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. 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.
dcterms:title
Sparse binary matrices Sparse binary matrices Sparse binary matrices
skos:prefLabel
Sparse binary matrices Sparse binary matrices Sparse binary matrices
skos:notation
RIV/61989100:27240/05:00012186!RIV06-GA0-27240___
n3:strany
103-116
n3:aktivita
n6:P
n3:aktivity
P(GP201/05/P145)
n3:dodaniDat
n5:2006
n3:domaciTvurceVysledku
n9:9491562 n9:4347269 n9:8939381
n3:druhVysledku
n12:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n4:predkladatel
n3:idSjednocenehoVysledku
543773
n3:idVysledku
RIV/61989100:27240/05:00012186
n3:jazykVysledku
n11:eng
n3:klicovaSlova
web link analysis [6]; binary factor analysis [7] performs huge number of computations
n3:klicoveSlovo
n13:binary%20factor%20analysis%20%5B7%5D%20performs%20huge%20number%20of%20computations n13:web%20link%20analysis%20%5B6%5D
n3:kontrolniKodProRIV
[70F225A18E3B]
n3:mistoKonaniAkce
Ráčkova Dolina
n3:mistoVydani
Košice
n3:nazevZdroje
ITAT 2005
n3:obor
n19:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n10:GP201%2F05%2FP145
n3:rokUplatneniVysledku
n5:2005
n3:tvurceVysledku
Snášel, Václav Martinovič, Jan Dvorský, Jiří
n3:typAkce
n17:CST
n3:zahajeniAkce
2005-09-20+02:00
s:numberOfPages
14
n15:hasPublisher
Univerzita P. J. Šafárika v Košiciach
n21:isbn
80-7097-609-8
n18:organizacniJednotka
27240