Zobrazeno 1 - 10
of 130
pro vyhledávání: '"Graham M. Megson"'
Autor:
Oswaldo Cadenas, Graham M Megson
Publikováno v:
PLoS ONE, Vol 14, Iss 2, p e0212189 (2019)
This paper presents a method to reduce a set of n 2D points to a smaller set of s 2D points with the property that the convex hull on the smaller set is the same as the convex hull of the original bigger set. The paper shows, experimentally, that suc
Externí odkaz:
https://doaj.org/article/ff6c392ce7844222b2a502cb9ef9c54c
Publikováno v:
PLoS ONE, Vol 11, Iss 3, p e0149860 (2016)
In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D
Externí odkaz:
https://doaj.org/article/81d217d0264e49a3ad9d716bb07097ff
Autor:
Oswaldo Cadenas, Graham M. Megson
Publikováno v:
IEEE Embedded Systems Letters. 11:58-61
A novel algorithm is proposed to compute the median of a running window of ${m}$ integers in ${O}$ (lg lg ${m}$ ) time. For a new window, the new median value is computed as a simple decision based on the previous median, and the values removed and i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::932b8a9b9ee76216e474f3ff665455b6
https://doi.org/10.1109/les.2018.2868409
https://doi.org/10.1109/les.2018.2868409
Publikováno v:
IEEE Transactions on Circuits and Systems II: Express Briefs. 62:661-665
The time to process each of the $W/B$ processing blocks of a median calculation method on a set of $N$ $W$ -bit integers is improved here by a factor of three compared with literature. The parallelism uncovered in blocks containing $B$ -bit slices is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ef2d1406b7341f4f6ded81542b3ad04
https://doi.org/10.1109/tcsii.2015.2415655
https://doi.org/10.1109/tcsii.2015.2415655
Autor:
Graham M. Megson, Oswaldo Cadenas
Publikováno v:
PLoS ONE
PLoS ONE, Vol 14, Iss 2, p e0212189 (2019)
PLoS ONE, Vol 14, Iss 2, p e0212189 (2019)
© 2019 Cadenas, Megson. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb48f2da58bfbffca58e952ba1f47736
https://doi.org/10.1371/journal.pone.0212189
https://doi.org/10.1371/journal.pone.0212189
Publikováno v:
IEEE Transactions on Consumer Electronics
A parallel pipelined array of cells suitable for real-time computation of histograms is proposed. The cell architecture builds on previous work obtained via C-slow retiming techniques and can be clocked at 65 percent faster frequency than previous ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de768ff3f36cc5fce9870d2b7ba7a505
https://doi.org/10.1109/tce.2013.6531108
https://doi.org/10.1109/tce.2013.6531108
Publikováno v:
PLoS ONE
PLoS ONE, Vol 11, Iss 3, p e0149860 (2016)
PLoS ONE, Vol 11, Iss 3, p e0149860 (2016)
In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ? n, which also contains the same hull. We present an algorithm to precondition 2D da
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d48cb3ea7f72ea7b863d721b4ad6719b
http://europepmc.org/articles/PMC4777294
http://europepmc.org/articles/PMC4777294
Autor:
Jose O. Cadenas, Graham M. Megson
Publikováno v:
Electronics Letters. 50:270-272
Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61844527d4777c8c811b36e8d1f17bb7
https://doi.org/10.1049/el.2013.3507
https://doi.org/10.1049/el.2013.3507
Publikováno v:
International Journal of Computer Mathematics. 85:1771-1778
In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1aa3de8fed918913be71e55ce9fda19
https://doi.org/10.1080/00207160701619200
https://doi.org/10.1080/00207160701619200
Publikováno v:
International Journal of Parallel, Emergent and Distributed Systems. 22:185-192
In this paper, we introduce two kinds of graphs: the generalized matching networks (GMNs) and the recursive generalized matching networks (RGMNs). The former generalize the hypercube-like networks (HLNs), while the latter include the generalized cube
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a6621574d4cd9bd347513467b866b87
https://doi.org/10.1080/17445760601139039
https://doi.org/10.1080/17445760601139039