Zobrazeno 1 - 10
of 43
pro vyhledávání: '"James L. Schwing"'
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 12:875-887
The main contribution of this work is to show that a number of fundamental and seemingly unrelated problems in database design, pattern recognition, robotics, computational geometry, and image processing can be solved simply and elegantly by stating
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f58432f29a30f0942d82fe4d88b6c43b
https://doi.org/10.1109/71.954618
https://doi.org/10.1109/71.954618
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 10:266-280
The first main contribution of this work is to propose an efficient VLSI architecture obtained by augmenting the Mesh with Multiple Broadcasting (MMB) with precharged 1-bit row and column buses. The new architecture, which we call Mesh with Hybrid Bu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3fbc1dd0c54500b543361a8474d1c34c
https://doi.org/10.1109/71.755826
https://doi.org/10.1109/71.755826
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 10:1276-1289
The main contribution of this work is to present elegant broadcast-efficient protocols for permutation routing, ranking, and sorting on single-hop Mobile Radio Networks with p stations and k radio channels, denoted by MRN(p,k). Clearly, any protocol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a06d36e685ce20bf5208d74816f21ce
https://doi.org/10.1109/71.819949
https://doi.org/10.1109/71.819949
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 9:1057-1072
A number of applications in computer-aided manufacturing, CAD, and computer-aided geometric design ask for triangulating pieces of material with defects. These tasks are known collectively as constrained triangulations. Recently, a powerful architect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40df3ed311475acaef041b5a3087586a
https://doi.org/10.1109/71.735954
https://doi.org/10.1109/71.735954
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 9:929-937
Sorting is a fundamental problem with applications in all areas of computer science and engineering. In this work, we address the problem of sorting on mesh connected computers enhanced by endowing each row and each column with its own dedicated high
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cab48d311e6fef5ab76e0f6c0c7ca108
https://doi.org/10.1109/71.730522
https://doi.org/10.1109/71.730522
A time-optimal solution to a classification problem in ordered functional domains, with applications
Publikováno v:
Scopus-Elsevier
Consider a family C of classifiers represented by continuous functions stored, in discretized form, one function per processor in one column of a mesh with multiple broadcasting of size √n × √n In a number of contexts in pattern recognition, mor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::729012c34085830199cd6a017e5a4802
https://doi.org/10.1016/s0031-3203(96)00151-3
https://doi.org/10.1016/s0031-3203(96)00151-3
Publikováno v:
Parallel Algorithms and Applications. 10:211-224
Computer vision tasks are traditionally partitioned into three distinct categories, depending on the types of objects they operate on. It is fairly standard to refer to the computational tasks involving two-dimensional arrays of pixels as low-level t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02bf256f63082b9e2e752ffc6db467ae
https://doi.org/10.1080/10637199708915618
https://doi.org/10.1080/10637199708915618
Autor:
Stephan Olariu, James L. Schwing
Publikováno v:
Journal of Parallel and Distributed Computing. 32:215-222
The main contribution of this work is to present a simple deterministic sampling strategy that, when used for bucket sorting, yields buckets that are remarkably well balanced, making costly balancing unnecessary. To the best of our knowledge, this is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60e3e1c71e5776272735f633c91b2a51
https://doi.org/10.1006/jpdc.1996.0015
https://doi.org/10.1006/jpdc.1996.0015
Publikováno v:
Information Processing Letters. 56:273-280
Computing the convex hull of a planar set of points is one of the most extensively investigated topics in computational geometry. Our main contribution is to present the first known general-case, time- and VLSI-optimal, algorithm for convex hull comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcc19d9bee59f36324ce03a6e3224774
https://doi.org/10.1016/0020-0190(95)00160-8
https://doi.org/10.1016/0020-0190(95)00160-8
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. :601-613
The main contribution of this work is to show that a number of digital geometry problems can be solved elegantly on meshes with multiple broadcasting by using a time-optimal solution to the leftmost one problem as a basic subroutine. Consider a binar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2bb6115da337b1c4c76342d262ae672b
https://doi.org/10.1142/s0218001495000225
https://doi.org/10.1142/s0218001495000225