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

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

Namespace Prefixes

PrefixIRI
n4http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n16http://purl.org/net/nknouf/ns/bibtex#
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F02%3A00006706%21RIV%2F2003%2FGA0%2F272403%2FN/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://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/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F02%3A00006706%21RIV%2F2003%2FGA0%2F272403%2FN
rdf:type
skos:Concept n14:Vysledek
dcterms:description
Compression methods based on finite automatons are presented in this paper. Simple algorithm for construction finite automaton for given regular expression is shown. The best advantage of this algorithms is the possibility of random access to a compressed text. The compression ratio achieved is fairly good. The methods are independent on source alphabet i.e. algorithms can be character or word based. Compression methods based on finite automatons are presented in this paper. Simple algorithm for construction finite automaton for given regular expression is shown. The best advantage of this algorithms is the possibility of random access to a compressed text. The compression ratio achieved is fairly good. The methods are independent on source alphabet i.e. algorithms can be character or word based.
dcterms:title
Random access compression methods, Random access compression methods,
skos:prefLabel
Random access compression methods, Random access compression methods,
skos:notation
RIV/61989100:27240/02:00006706!RIV/2003/GA0/272403/N
n3:strany
17 - 27
n3:aktivita
n6:P
n3:aktivity
P(GA201/00/1031)
n3:dodaniDat
n7:2003
n3:domaciTvurceVysledku
n15:8939381 n15:4347269
n3:druhVysledku
n19:D
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
661472
n3:idVysledku
RIV/61989100:27240/02:00006706
n3:jazykVysledku
n18:eng
n3:klicovaSlova
data compression, finite automata, direct access compression
n3:klicoveSlovo
n12:direct%20access%20compression n12:finite%20automata n12:data%20compression
n3:kontrolniKodProRIV
[1F9F382A51F2]
n3:mistoKonaniAkce
Malino Brdo, Velká Fatra
n3:mistoVydani
Košice
n3:nazevZdroje
ITAT 2002
n3:obor
n11:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n5:GA201%2F00%2F1031
n3:rokUplatneniVysledku
n7:2002
n3:tvurceVysledku
Dvorský, Jiří Snášel, Václav
n3:typAkce
n4:EUR
n3:zahajeniAkce
2002-09-12+02:00
s:numberOfPages
11
n16:hasPublisher
UPJŠ
n17:organizacniJednotka
27240