A Simple Yet Fast Algorithm for the Closest-Pair Problem Using Sorted Projections on Multi-Dimensions.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/iscis/DalkilicE13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/iscis/DalkilicE13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mehmet_Emin_Dalkili%E2%88%9A%C3%9F
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Serkan_Ergun
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-319-01604-7%5F3
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-319-01604-7_3
>
dc:
identifier
DBLP conf/iscis/DalkilicE13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-319-01604-7%5F3
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
rdfs:
label
A Simple Yet Fast Algorithm for the Closest-Pair Problem Using Sorted Projections on Multi-Dimensions.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mehmet_Emin_Dalkili%E2%88%9A%C3%9F
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Serkan_Ergun
>
swrc:
pages
23-34
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/iscis/2013
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/iscis/DalkilicE13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/iscis/DalkilicE13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/iscis/iscis2013.html#DalkilicE13
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-319-01604-7_3
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/iscis
>
dc:
title
A Simple Yet Fast Algorithm for the Closest-Pair Problem Using Sorted Projections on Multi-Dimensions.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document