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

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

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n7http://localhost/temp/predkladatel/
n6http://purl.org/net/nknouf/ns/bibtex#
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F02%3A00006707%21RIV%2F2003%2FGA0%2F272403%2FN/
n9https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F02%3A00006707%21RIV%2F2003%2FGA0%2F272403%2FN
rdf:type
skos:Concept n21: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
Two methods for random access compression. Two methods for random access compression.
skos:prefLabel
Two methods for random access compression. Two methods for random access compression.
skos:notation
RIV/61989100:27240/02:00006707!RIV/2003/GA0/272403/N
n4:strany
10
n4:aktivita
n20:P
n4:aktivity
P(GA201/00/1031)
n4:dodaniDat
n12:2003
n4:domaciTvurceVysledku
n8:8939381 n8:4347269
n4:druhVysledku
n15:D
n4:duvernostUdaju
n5:S
n4:entitaPredkladatele
n13:predkladatel
n4:idSjednocenehoVysledku
667564
n4:idVysledku
RIV/61989100:27240/02:00006707
n4:jazykVysledku
n17:eng
n4:klicovaSlova
data compression, finite automata, direct access compression
n4:klicoveSlovo
n14:finite%20automata n14:direct%20access%20compression n14:data%20compression
n4:kontrolniKodProRIV
[45BC8A562CC2]
n4:mistoKonaniAkce
Malaga, Spain
n4:mistoVydani
Malaga
n4:nazevZdroje
AH'2002, Proceedings of the Workshop on Document Compression and Synthesis in Adaptive Hypermedia Systems
n4:obor
n19:JC
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:pocetUcastnikuAkce
0
n4:pocetZahranicnichUcastnikuAkce
0
n4:projekt
n10:GA201%2F00%2F1031
n4:rokUplatneniVysledku
n12:2002
n4:tvurceVysledku
Snášel, Václav Dvorský, Jiří
n4:typAkce
n16:EUR
n4:zahajeniAkce
2002-01-01+01:00
s:numberOfPages
1
n6:hasPublisher
Universidad de Malaga
n9:isbn
699-8194-3
n7:organizacniJednotka
27240