Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Brenton Lessley"'
Autor:
Hank Childs, Brenton Lessley
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 31:237-250
Hash tables are a fundamental data structure for effectively storing and accessing sparse data, with widespread usage in domains ranging from computer graphics to machine learning. This study surveys the state-of-the-art research on data-parallel has
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030507428
This work examines performance characteristics of multiple shared-memory implementations of a probabilistic graphical modeling (PGM) optimization code, which forms the basis for an advanced, state-of-the art image segmentation method. The work is mot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc2b82dfc6d7a5bdc72fa996cd4c0d88
https://doi.org/10.1007/978-3-030-50743-5_7
https://doi.org/10.1007/978-3-030-50743-5_7
Publikováno v:
Visualization and Data Analysis
Publikováno v:
International Journal of Human-Computer Studies. 83:83-93
Humans are reflective, adaptive, and social. They recall the past, sometimes discuss these recollections with others and become nostalgic; yet, previous research has not examined nostalgia in social media. This paper investigates the expression of no
Publikováno v:
LDAV
Lessley, B; Perciano, T; Mathai, M; Childs, H; & Bethel, EW. (2017). Maximal clique enumeration with data-parallel primitives. 2017 IEEE 7th Symposium on Large Data Analysis and Visualization, LDAV 2017, 2017-December, 16-25. doi: 10.1109/LDAV.2017.8231847. Lawrence Berkeley National Laboratory: Retrieved from: http://www.escholarship.org/uc/item/4rj928sn
Lessley, B; Perciano, T; Mathai, M; Childs, H; & Bethel, EW. (2017). Maximal clique enumeration with data-parallel primitives. 2017 IEEE 7th Symposium on Large Data Analysis and Visualization, LDAV 2017, 2017-December, 16-25. doi: 10.1109/LDAV.2017.8231847. Lawrence Berkeley National Laboratory: Retrieved from: http://www.escholarship.org/uc/item/4rj928sn
© 2017 IEEE. The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in several research areas. We consider maximal clique enumeration on shared-memory, multi-core architectures and introduce an approach consis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b94860dbe8f259d73077b4eb8d4321b
https://escholarship.org/uc/item/4rj928sn
https://escholarship.org/uc/item/4rj928sn
Publikováno v:
LDAV
We study effective shared-memory, data-parallel techniques for searching for duplicate elements. We consider several data-parallel approaches, and how hash function, machine architecture, and data set can affect performance. We conclude that most cho
Publikováno v:
Journal of Emerging Technologies in Accounting. 9:71-94
In this paper, we use a Genetic Algorithm (GA) and MARLEDA—a modern Estimation of Distribution Algorithm (EDA)—to evolve and train several fuzzy rule-based classifiers (FRBCs) to detect patterns of financial statement fraud. We find that both GA