Zobrazeno 1 - 10
of 45
pro vyhledávání: '"D. Bhagavathi"'
Publikováno v:
International Journal of Current Microbiology and Applied Sciences. 8:2136-2143
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18fd8bb0859c276a0ee8a9d966847ea2
https://doi.org/10.20546/ijcmas.2019.811.248
https://doi.org/10.20546/ijcmas.2019.811.248
Publikováno v:
International Journal of Current Microbiology and Applied Sciences. 8:2308-2322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0ecb2bf1735d32edd99f80cb23c251d
https://doi.org/10.20546/ijcmas.2019.811.268
https://doi.org/10.20546/ijcmas.2019.811.268
Publikováno v:
Journal of Food Engineering. 43:205-211
A thin film scraped surface evaporator (TFSSE), similar to that of Luwa's model was developed for concentration of fruit juices and pulps. The main body of the evaporator was 1.4 m high and 0.22 m in diameter. The TFSSE was evaluated for the effect o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41bd14a2bb834f7f4012e252612ec691
https://doi.org/10.1016/s0260-8774(99)00150-8
https://doi.org/10.1016/s0260-8774(99)00150-8
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
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 7:545-554
Recently it has been noticed that for semigroup computations and for selection, rectangular meshes with multiple broadcasting yield faster algorithms than their square counterparts. The contribution of the paper is to provide yet another example of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccb776bedcd1509131b14b7973d195b3
https://doi.org/10.1109/71.506693
https://doi.org/10.1109/71.506693
Autor:
Stephan Olariu, James L. Schwing, Ivan Stojmenovic, V. Bokka, D. Bhagavathi, H. Gurla, Jingyuan Zhang
Publikováno v:
ASAP
Given a collection of objects in the plane along with a viewpoint /spl omega/, the visibility problem involves determining the portion of each object that is visible to an observer positioned at /spl omega/. The visibility problem is central to vario
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93a6252f758371bb9de1684c638a154b
https://doi.org/10.1109/71.395398
https://doi.org/10.1109/71.395398
Publikováno v:
Journal of Parallel and Distributed Computing. 27:142-156
Our contribution is twofold. First, we show that Ω(log n ) is a time lower bound on the CREW-PRAM and the mesh with multiple broadcasting for the tasks of computing the perimeter, the area, the diameter, the width, the modality, the smallest-area en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6f551af17b66768148afa5cf18e445c
https://doi.org/10.1006/jpdc.1995.1078
https://doi.org/10.1006/jpdc.1995.1078
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 5:772-778
One of the fundamental algorithmic problems in computer science involves selecting the kth smallest element in a collection A of n elements. We propose an algorithm design methodology to solve the selection problem on meshes with multiple broadcastin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39bc45e08e48743aad1ce07572b34026
https://doi.org/10.1109/71.296326
https://doi.org/10.1109/71.296326
Publikováno v:
Journal of Parallel and Distributed Computing. 22:113-120
Given a sorted sequence A = a1, a2, ..., an of items from a totally ordered universe, along with an arbitrary sequence Q = q1, q2, ..., qm (1 ? m ? n) of queries, the multiple search problem involves computing for every qj (1 ? j ? m) the unique ai f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db5774035fe1d1cf4baf69668b3fe22b
https://doi.org/10.1006/jpdc.1994.1074
https://doi.org/10.1006/jpdc.1994.1074
Publikováno v:
Parallel Processing Letters. :73-82
Given a sequence of m items α1, α2,…, αm from a semigroup S with an associative operation ⊕, the semigroup computation problem involves computing α1 ⊕ α2 ⊕…⊕ αm. We consider the semigroup computation problem involving m (2≤m≤n)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82994a6d77002f739884c2e3f039035e
https://doi.org/10.1142/s0129626494000090
https://doi.org/10.1142/s0129626494000090