This HTML5 document contains 47 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/
n22http://purl.org/net/nknouf/ns/bibtex#
n13http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n23http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F13%3A00066560%21RIV14-GA0-14330___/
n12http://linked.opendata.cz/resource/domain/vavai/subjekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n7http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F13%3A00066560%21RIV14-GA0-14330___
rdf:type
n11:Vysledek skos:Concept
dcterms:description
The field of similarity search on metric spaces has been widely studied in the last years, mainly because it has proven suitable for a number of application domains such as multimedia retrieval and computational biology, just to name a few. To achieve efficient query execution throughput, it is essential to exploit the intrinsic parallelism in respective search algorithms. Many strategies have been proposed in the literature to parallelize these algorithms either on shared or distributed memory multiprocessor systems. The field of similarity search on metric spaces has been widely studied in the last years, mainly because it has proven suitable for a number of application domains such as multimedia retrieval and computational biology, just to name a few. To achieve efficient query execution throughput, it is essential to exploit the intrinsic parallelism in respective search algorithms. Many strategies have been proposed in the literature to parallelize these algorithms either on shared or distributed memory multiprocessor systems.
dcterms:title
Multi-level Clustering on Metric Spaces Using a Multi-GPU Platform Multi-level Clustering on Metric Spaces Using a Multi-GPU Platform
skos:prefLabel
Multi-level Clustering on Metric Spaces Using a Multi-GPU Platform Multi-level Clustering on Metric Spaces Using a Multi-GPU Platform
skos:notation
RIV/00216224:14330/13:00066560!RIV14-GA0-14330___
n11:predkladatel
n12:orjk%3A14330
n3:aktivita
n17:P
n3:aktivity
P(GBP103/12/G084)
n3:dodaniDat
n9:2014
n3:domaciTvurceVysledku
n19:3165647
n3:druhVysledku
n21:D
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
90079
n3:idVysledku
RIV/00216224:14330/13:00066560
n3:jazykVysledku
n20:eng
n3:klicovaSlova
Similarity Search; Metric Spaces; GPU; Range queries
n3:klicoveSlovo
n6:Similarity%20Search n6:Range%20queries n6:GPU n6:Metric%20Spaces
n3:kontrolniKodProRIV
[F65C508CF66B]
n3:mistoKonaniAkce
Aachen
n3:mistoVydani
Berlin
n3:nazevZdroje
Euro-Par 2013 Parallel Processing - 19th International Conference
n3:obor
n4:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
5
n3:projekt
n23:GBP103%2F12%2FG084
n3:rokUplatneniVysledku
n9:2013
n3:tvurceVysledku
Gomez, Jose Barrientos, Ricardo Zezula, Pavel Prieto-Matias, Manuel Tenllado, Christian
n3:typAkce
n16:WRD
n3:zahajeniAkce
2013-01-01+01:00
s:issn
0302-9743
s:numberOfPages
13
n7:doi
10.1007/978-3-642-40047-6_24
n22:hasPublisher
Springer-Verlag
n18:isbn
9783642400469
n13:organizacniJednotka
14330