Data-partitioning using the Hilbert space filling curves: Effect on the speed of convergence of Fuzzy ARTMAP for large database problems

Castro, José Villaverde; Georgiopoulos, Michael; DeMara, Ronald F.; González, Avelino J.

doi:10.1016/j.neunet.2005.01.007

Cited by 25 publications

(5 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. 26 6 The orientation of each part after a Hilbert curve is evenly partitioned into four parts for different orientations: case type of 0 : case type of 0 : 4 4 281 16 5 5 297 16 6 6 327 16 7 7 343…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Quad-splitting algorithm for a window query on a Hilbert curve

Chang

2009

IET Image Processing

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

“…There have been found many applications in a variety of fields including image processing and compression [9,21], spatial query [7], wireless sensor networks [1], wireless broadcast system [26], neural networks [5], genome visualization [11], index of multi-dimensional data [20], spatiotemporal index [25] and bandwidth compression [2].…”

Section: Introductionmentioning

confidence: 99%

Quad-splitting algorithm for a window query on a Hilbert curve

Chang

2009

IET Image Processing

View full text Add to dashboard Cite

“…The first approach involves a lot of memory that is used to store all the computing mesh on all memory devices and the second one involve that particle workload is not well balanced over the cores. To localize particles we choose to partition the computing mesh using a Hilbert curve method (Castro, Georgiopoulos, Demara, and Gonzalez 2005) and create an overlapping structured grid with the minimum and maximum coordinates of the computing mesh. Figure 3 shows the structured grid overlapping the computing mesh as a bounding box.…”

Section: Library Architecturementioning

confidence: 99%

Software Architecture for parallel particle tracking with the distribution of large amount of data

Bonnier¹,

Emad²,

Juvigny³

2017

High Performance Computing Symposium (HPC 2018)

View full text Add to dashboard Cite

This study is about the architecture of a library designed for particle tracking. This library exposes common features used to track particles in large meshes using parallel algorithms to localize, manage, distribute and move particles over computing units. The proposed library design ables particles to be tracked using multiple heterogeneous parallel paradigms with component reusability. A customized algorithm to distribute particles over processes has been developed that uses different features of this architecture and shows a high impact on particle localization and movement execution time.

show abstract

“…There are many space-filling curves available, including the Peano, Z, Hilbert, sweep, scan, and gray curves [41]. The Hilbert space-filling curve is believed to achieve the best clustering [42,43].…”

Section: Hilbert Curve-based Searching Schemementioning

confidence: 99%

A locality-aware similar information searching scheme

Lin

Shen

2014

Int J Digit Libr

View full text Add to dashboard Cite

In a database, a similar information search means finding data records which contain the majority of search keywords. Due to the rapid accumulation of information nowadays, the size of databases has increased dramatically. An efficient information searching scheme can speed up information searching and retrieve all relevant records. This paper proposes a Hilbert curve-based similarity searching scheme (HCS). HCS considers a database to be a multidimensional space and each data record to be a point in the multidimensional space. By using a Hilbert space filling curve, each point is projected from a high-dimensional space to a lowdimensional space, so that the points close to each other in the high-dimensional space are gathered together in the lowdimensional space. Because the database is divided into many clusters of close points, a query is mapped to a certain cluster instead of searching the entire database. Experimental results prove that HCS dramatically reduces the search time latency and exhibits high effectiveness in retrieving similar information.

show abstract

Data-partitioning using the Hilbert space filling curves: Effect on the speed of convergence of Fuzzy ARTMAP for large database problems

Cited by 25 publications

References 35 publications

Quad-splitting algorithm for a window query on a Hilbert curve

Quad-splitting algorithm for a window query on a Hilbert curve

Software Architecture for parallel particle tracking with the distribution of large amount of data

A locality-aware similar information searching scheme

Contact Info

Product

Resources

About