Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Zhaofang Wen"'
Autor:
Zhaofang Wen
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 7:11-17
The problem of merging k (k/spl ges/2) sorted lists is considered. We give an optimal parallel algorithm which takes O((n log k/p)+log n) time using p processors on a parallel random access machine that allows concurrent reads and exclusive writes, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e3563d75d1655ad98e7d462284e373e
https://doi.org/10.1109/71.481593
https://doi.org/10.1109/71.481593
Publikováno v:
Journal of Parallel and Distributed Computing. 27:100-105
We consider the following problem. For a binary tree T = ( V , E ) where V = {1, 2, ..., n }, given its inorder traversal and either its preorder or its postorder traversal, reconstruct the binary tree. We present a new parallel algorithm for this pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1cb8dc8ba563c63f2d06838589b9b1c
https://doi.org/10.1006/jpdc.1995.1075
https://doi.org/10.1006/jpdc.1995.1075
Autor:
Zhaofang Wen
Publikováno v:
Parallel Computing. 21:461-466
A problem in pattern recognition is to find the maximum sum over all rectangular subregions of a given (n × n) matrix of real numbers. The problem has one-dimensional (1D) and two-dimensional (2D) versions. For the 1D version, it is to find the maxi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0473fed76f8ccb62a611e076f98b502e
https://doi.org/10.1016/0167-8191(94)00063-g
https://doi.org/10.1016/0167-8191(94)00063-g
Autor:
Zhaofang Wen
Publikováno v:
Information Processing Letters. 51:11-16
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbf6262390d25a51e3c0e61c5ab1658b
https://doi.org/10.1016/0020-0190(94)00058-1
https://doi.org/10.1016/0020-0190(94)00058-1
Autor:
Zhaofang Wen, Stephan Olariu
Publikováno v:
Parallel Processing Letters. :157-160
The purpose of this short note is to show that the problem of reconstructing a directed forest from a collection of leaf-to-root paths can be done efficiently in parallel by reducing the problem to integer sorting. Specifically, given M the total len
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b552e79de377f47786ba815402dc08e2
https://doi.org/10.1142/s0129626492000271
https://doi.org/10.1142/s0129626492000271
Autor:
Zhaofang Wen, Stephan Olariu
Publikováno v:
International Journal of Computer Mathematics. 42:61-65
Recently, Carlsson [3] proposed a variation of the heap data structure as an efficient implementation of a double-ended priority queue. This new data structure is referred to as the deap. We show that constructing a deap with special properties can b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::042656d4af0ac8b31ed921cd9d8def70
https://doi.org/10.1080/00207169208804050
https://doi.org/10.1080/00207169208804050
Publikováno v:
ICPP
This paper presents a parallel programming model, Parallel Phase Model (PPM), for next-generation high-end parallel machines based on a distributed memory architecture consisting of a networked cluster of nodes with a large number of cores on each no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5cab92db8fd4885c55ebf30258a66c6
https://doi.org/10.1109/icpp.2009.69
https://doi.org/10.1109/icpp.2009.69
Publikováno v:
Parallel Computing. 17:683-687
The measure problem involves computing the area of the union of a set of n iso-oriented rectangles in the plane. Recently, it has been shown that for a set of n such rectangles, the measure problem can be solved in O(log n log log n) time, using O(n/
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bdbab9ecfea2929c1aeb13c5dade5c9
https://doi.org/10.1016/s0167-8191(05)80058-4
https://doi.org/10.1016/s0167-8191(05)80058-4
Autor:
Stephan Olariu, Zhaofang Wen
Publikováno v:
Parallel Computing. 17:689-693
The problem of multiselection arises frequently in databases. Here, given an unordered set S of n records and a sequence of m integers 1 =< q"1 < q"2 < ... < q"m =< n we are interested in answering queries of the type 'find the q"ith smallest element
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5665b9618964b7d429fe0f416ec57255
https://doi.org/10.1016/s0167-8191(05)80059-6
https://doi.org/10.1016/s0167-8191(05)80059-6
Publikováno v:
The Computer Journal. 34:423-427
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2633ba2eea9f83c227d03c6791654fd
https://doi.org/10.1093/comjnl/34.5.423
https://doi.org/10.1093/comjnl/34.5.423