<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Design and optimization of DBSCAN Algorithm based on CUDA · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1506.02226/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1506.02226/feed.xml" rel="self" type="application/rss+xml" /><item><title>Design and optimization of DBSCAN Algorithm based on CUDA — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=12182097</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02226:12182097</guid><pubDate>Thu, 28 Jul 2016 18:28:06 GMT</pubDate><description>&lt;p&gt;A Google search reveals this paper: https://arxiv.org/abs/1506.02226 This paper claims a &amp;quot;97x improvement&amp;quot; over traditional (non-parallelized) DBSCAN algorithms, but that&amp;#x27;s not a very helpful claim, because it does not indicate what the computational costs are as a function of, say, the number of data points or dimensions.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.02226/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
