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
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F09%3A00029212%21RIV10-GA0-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F09%3A00029212%21RIV10-GA0-14330___
rdf:type
skos:Concept n11:Vysledek
dcterms:description
In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset. In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset.
dcterms:title
Distance browsing in distributed multimedia databases Distance browsing in distributed multimedia databases
skos:prefLabel
Distance browsing in distributed multimedia databases Distance browsing in distributed multimedia databases
skos:notation
RIV/00216224:14330/09:00029212!RIV10-GA0-14330___
n5:aktivita
n8:P
n5:aktivity
P(GD102/05/H050), P(GP201/07/P240), P(GP201/08/P507)
n5:cisloPeriodika
1
n5:dodaniDat
n6:2010
n5:domaciTvurceVysledku
n18:3165647
n5:druhVysledku
n9:J
n5:duvernostUdaju
n12:S
n5:entitaPredkladatele
n14:predkladatel
n5:idSjednocenehoVysledku
310802
n5:idVysledku
RIV/00216224:14330/09:00029212
n5:jazykVysledku
n17:eng
n5:klicovaSlova
distance; browsing; multimedia
n5:klicoveSlovo
n13:browsing n13:multimedia n13:distance
n5:kodStatuVydavatele
NL - Nizozemsko
n5:kontrolniKodProRIV
[07E72DCE7356]
n5:nazevZdroje
Future Generation Computer Systems
n5:obor
n16:IN
n5:pocetDomacichTvurcuVysledku
1
n5:pocetTvurcuVysledku
4
n5:projekt
n10:GP201%2F08%2FP507 n10:GD102%2F05%2FH050 n10:GP201%2F07%2FP240
n5:rokUplatneniVysledku
n6:2009
n5:svazekPeriodika
25/2009
n5:tvurceVysledku
Falchi, Fabrizio Rabitti, Fausto Zezula, Pavel Gennaro, Claudio
n5:wos
000260238300008
s:issn
0167-739X
s:numberOfPages
13
n15:organizacniJednotka
14330