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

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

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n20http://localhost/temp/predkladatel/
n22http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F08%3A00005456%21RIV12-MSM-15310___/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
n13https://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#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F08%3A00005456%21RIV12-MSM-15310___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
This paper presents a parallel algorithm for computing formal concepts. Presented is a sequential version upon which we build the parallel one. We describe the algorithm, its implementation, scalability, and provide an initial experimental evaluation of its efficiency. The algorithm is fast, memory efficient, and can be optimized so that all critical operations are reduced to low-level bit-array operations. One of the key features of the algorithm is that it avoids synchronization which has positive impacts on its speed and implementation. This paper presents a parallel algorithm for computing formal concepts. Presented is a sequential version upon which we build the parallel one. We describe the algorithm, its implementation, scalability, and provide an initial experimental evaluation of its efficiency. The algorithm is fast, memory efficient, and can be optimized so that all critical operations are reduced to low-level bit-array operations. One of the key features of the algorithm is that it avoids synchronization which has positive impacts on its speed and implementation.
dcterms:title
Parallel Recursive Algorithm for FCA Parallel Recursive Algorithm for FCA
skos:prefLabel
Parallel Recursive Algorithm for FCA Parallel Recursive Algorithm for FCA
skos:notation
RIV/61989592:15310/08:00005456!RIV12-MSM-15310___
n3:aktivita
n5:Z n5:P
n3:aktivity
P(1ET101370417), Z(MSM6198959214)
n3:dodaniDat
n6:2012
n3:domaciTvurceVysledku
n4:1236784 n4:1865994 n4:5572983
n3:druhVysledku
n18:D
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
385883
n3:idVysledku
RIV/61989592:15310/08:00005456
n3:jazykVysledku
n17:eng
n3:klicovaSlova
formal concept analysis, concept lattice, parallel algorithm
n3:klicoveSlovo
n15:parallel%20algorithm n15:concept%20lattice n15:formal%20concept%20analysis
n3:kontrolniKodProRIV
[9D3B468DDD4A]
n3:mistoKonaniAkce
Olomouc
n3:mistoVydani
Olomouc
n3:nazevZdroje
Concept Lattices and Their Applications 2008
n3:obor
n19:BD
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n22:1ET101370417
n3:rokUplatneniVysledku
n6:2008
n3:tvurceVysledku
Vychodil, Vilém Krajča, Petr Outrata, Jan
n3:typAkce
n12:WRD
n3:zahajeniAkce
2008-10-21+02:00
n3:zamer
n14:MSM6198959214
s:numberOfPages
12
n21:hasPublisher
Univerzita Palackého v Olomouci
n13:isbn
978-80-244-2111-7
n20:organizacniJednotka
15310