2018
DOI: 10.1007/s00500-018-3050-z
|View full text |Cite
|
Sign up to set email alerts
|

Efficient parallel algorithm for computing rough set approximation on GPU

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 41 publications
0
4
0
Order By: Relevance
“…Designers can simply modify the data for each object in the design to change the design effect. It allows users not only to see the effect after modification, but also to choose a design style by comparing different effects (Jing et al, 2018 ). Its main advantage is to enhance the client's authority in the design process, so the client will be satisfied with the final design result.…”
Section: Research Methodology and System Frameworkmentioning
confidence: 99%
“…Designers can simply modify the data for each object in the design to change the design effect. It allows users not only to see the effect after modification, but also to choose a design style by comparing different effects (Jing et al, 2018 ). Its main advantage is to enhance the client's authority in the design process, so the client will be satisfied with the final design result.…”
Section: Research Methodology and System Frameworkmentioning
confidence: 99%
“…Це, відповідно, може прискорити роботу програм аналізу даних. В роботі [10] авторами пропонується застосування графічного процесора GPU для прискорення найсучаснішого послідовного алгоритму обчислення RSA, який базується на сортуванні. Три ключові етапи послідовного алгоритму розроблені паралельно, включаючи сортування об'єктів, обчислення класів еквівалентності та обчислення RSA.…”
Section: вступunclassified
“…B_LSD_RS algorithm scans the integer sequence from low bit to high bit. [37][38][39][40][41][42] Starting with the 0th bit, compare the 0th bits of all elements in the integer sequence number, move the element with the value 0 forward, and move the element with the value 1 back. Because the most bit number TA B L E 1 Sequential B_LSD_RS of eight elements of elements in the integer sequence is m, the algorithm needs to loop m times.…”
Section: Principle Of Algorithmmentioning
confidence: 99%
“…B_LSD_RS algorithm scans the integer sequence from low bit to high bit 37‐42 . Starting with the 0th bit, compare the 0th bits of all elements in the integer sequence number , move the element with the value 0 forward, and move the element with the value 1 back.…”
Section: Computational Characteristics Analysis Of Radix Sorting Algomentioning
confidence: 99%