Filters








1,092,513 Hits in 3.9 sec

Randomized parallel selection [chapter]

Sanguthevar Rajasekaran
1990 Lecture Notes in Computer Science  
unit of time (this model is called the parallel model and has been assumed by previous researchers (e.g., [?])).  ...  We show that selection on an input of size N can be performed on a P -node hypercube (P = N/(log N)) in time O(N/P ) with high probability, provided each node can process all the incident edges in one  ...  Randomization has been used to solve selection on a wide variety of parallel models. Meggido's [?]  ... 
doi:10.1007/3-540-53487-3_46 fatcat:ly44tx2lgfdahpzx7fvs4niuuy

An improved, randomized algorithm for parallel selection with an experimental study

David A. Bader
2004 Journal of Parallel and Distributed Computing  
This paper presents an efficient randomized high-level parallel algorithms for finding the median given a set of elements distributed across a parallel machine.  ...  In fact, our algorithm solves the general selection problem that requires the determination of the element of rank k, for an arbitrarily given integer k.  ...  Empirical Results Results for a previous implementation of the Fast randomized selection algorithm on the TMC CM-5 parallel machine appear in [2] .  ... 
doi:10.1016/j.jpdc.2004.06.010 fatcat:vcnishqvuzbdhmk4rmt4uxldui

Randomized Selection on the Hypercube

Sanguthevar Rajasekaran
1996 Journal of Parallel and Distributed Computing  
In this paper we present randomized algorithms for selection on the hypercube. We identify two variants of the hypercube namely, the sequential model and the parallel model.  ...  We specify three variations of the parallel model and present optimal randomized algorithms on all these three versions of parallel model.  ...  Selection on Weak Parallel We present a randomized selection algorithm in this section which runs in time O( n p + log p) on a p-node weak parallel hypercube.  ... 
doi:10.1006/jpdc.1996.0118 fatcat:4rhvpjhlofdbvjonc5ll5ri4ky

Randomized routing, selection, and sorting on the OTIS-mesh

S. Rajasekaran, S. Sahni
1998 IEEE Transactions on Parallel and Distributed Systems  
In this paper we present efficient algorithms for packet routing, sorting, and selection on the OTIS-Mesh.  ...  Therefore, the algorithm runs in a total of 8 √ N + o( √ N) time. ✷ Conclusions In this paper we have presented efficient randomized algorithms for packet routing, sorting, and selection.  ...  We also present algorithms for sorting and selection. Our sorting and selection algorithms run in time 8 √ N + o( √ N) and 6 √ N + o( √ N ) , respectively.  ... 
doi:10.1109/71.722217 fatcat:lla3sqbpgvgrvndqnqnksxgrr4

The impact of selection bias in randomized multi-arm parallel group clinical trials

Diane Uschner, Ralf-Dieter Hilgers, Nicole Heussen, Andre Scherag
2018 PLoS ONE  
In this paper, we investigate selection bias in multi-arm trials by its impact on the type I error probability.  ...  We propose two models for selection bias, so-called biasing policies, that both extend the classic guessing strategy by Blackwell and Hodges.  ...  Uschner D, Hilgers R-D, Heussen N (2018) The impact of selection bias in randomized multi-arm parallel group clinical trials.  ... 
doi:10.1371/journal.pone.0192065 pmid:29385190 pmcid:PMC5792025 fatcat:nkjd3vruxraxlbkhz2fpncseq4

L1 Cache Filtering Through Random Selection of Memory References

Yoav Etsion, Dror G. Feitelson
2007 Parallel Architecture and Compilation Techniques (PACT), Proceedings of the International Conference on  
We suggest using a simple probabilistic filtering mechanism based on random sampling to identify and select the frequently used blocks.  ...  Importantly, implementing such a predictor does not require saving any state information for the blocks, since every random selection is independent of its predecessors.  ...  Thus long residendcies are essentialy guaranteed to be selected.  ... 
doi:10.1109/pact.2007.4336215 fatcat:akrbkikrmfglpftcmvda2e77na

A parallel block-coordinate approach for primal-dual splitting with arbitrary random block selection

Audrey Repetti, Emilie Chouzenoux, Jean-Christophe Pesquet
2015 2015 23rd European Signal Processing Conference (EUSIPCO)  
Index Terms-convex optimization, nonsmooth optimization, primal-dual algorithm, stochastic algorithm, parallel algorithm, random block-coordinate approach, proximity operator, mesh denoising.  ...  In this paper we propose a random block-coordinate primal-dual algorithm, converging almost surely to a solution to the considered minimization problem.  ...  A major advantage of our method is that it allows the user to select the random sampling strategy leading to a minimal reconstruction time, without exceeding the available memory on its own computer architecture  ... 
doi:10.1109/eusipco.2015.7362380 dblp:conf/eusipco/RepettiCP15 fatcat:f2u2jrdrvzbavnr3uritc3b6ly

A Novel Credit Scoring Prediction Model based on Feature Selection Approach and Parallel Random Forest

Ha Van Sang, Nguyen Ha Nam, Nguyen Duc Nhan
2016 Indian Journal of Science and Technology  
Methods/Analysis: In this paper, we proposed a credit scoring model based on parallel Random Forest classifier and feature selection method to evaluate the credit risks of applicants.  ...  By integration of Random Forest into feature selection process, the importance of features can be accurately evaluated to remove irrelevant and redundant features.  ...  Conclusion In this paper, we integrated feature selection and parallel Random Forest method in credit scoring model.  ... 
doi:10.17485/ijst/2016/v9i20/92299 fatcat:3hal6zd2afebbgvgnu3y2fg4dm

WEIGHED RANDOM SELECTION METHOD FOR CONSTRUCTION OF PARTITIONING OF PARALLEL ALGORITHMS FLOWGRAPHS FOR LOGIC MULTICONTROLLERS DESIGNING

E. I. Vatutin, V. S. Panishev, S. N. Gvozdeva, V. S. Titov
2017 Известия Юго-Западного государственного университета  
Key words: discrete combinatorial optimization, parallel algorithms flowgraphs, partitioning, weighted random selection..  ...  Weighed Random Selection Method for Construction of Partitioning of Parallel Algorithms Flowgraphs for Logic Multicontrollers Designing, Proceedings of the Southwest State University, 2017, vol. 21, no  ... 
doi:10.21869/2223-1560-2017-21-6-6-21 fatcat:jw5xgjsspzhmrihzwq2cdqhq2m

Parallel Spatial–Spectral Hyperspectral Image Classification With Sparse Representation and Markov Random Fields on GPUs

Zebin Wu, Qicong Wang, Antonio Plaza, Jun Li, Le Sun, Zhihui Wei
2015 IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing  
Our parallel spatial-spectral classifier with sparse representation and Markov random fields (SSC-SRMRF-P) exploits the low-level architecture of GPUs.  ...  Index Terms-Compute unified device architecture (CUDA), graphics processing units (GPUs), hyperspectral imaging, Markov random fields (MRFs), parallel implementation, sparse representation, spatial-spectral  ...  Classification with kernel methods such as support vector machines (SVMs) [4] has been complemented using spatial information extraction using different strategies, most notably Markov random fields  ... 
doi:10.1109/jstars.2015.2413931 fatcat:c2ra47klgbgbvbb2tmojqqguke

Efficient and Accurate Electromagnetic Angular Sweeping of Rough Surfaces by MPI Parallel Randomized Low-rank Decomposition

Si-Lu Huang, Wei Song, Yi-Zhuo Wang, Yumao Wu, Xiao-Min Pan, Xin-Qing Sheng
2020 IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing  
Index Terms-Distributed memory parallel platform, message passing interface (MPI) parallelization, randomized low-rank decomposition, rank deficiency.  ...  A message passing interface (MPI) parallel scheme on distributed memory platforms is developed for the low-rank decomposition to accommodate the memory requirement during angular sweeping of a rough surface  ...  Parallelization 1) Selection of Parameter n u in Parallel Rank-QR: The performance of the blockwise approach discussed in Section III-B and the selection of n u are studied by computations of the Gauss-CS  ... 
doi:10.1109/jstars.2020.2981124 fatcat:a3j5x4y4fna3fm7jyxwa6nglz4

Clinical efficacy and safety of dotinurad, a novel selective urate reabsorption inhibitor, in Japanese hyperuricemic patients with or without gout: randomized, multicenter, double-blind, placebo-controlled, parallel-group, confirmatory phase 2 study

Tatsuo Hosoya, Takafumi Sano, Tomomitsu Sasaki, Masahiko Fushimi, Tetsuo Ohashi
2019 Clinical and Experimental Nephrology  
This was a confirmatory, 12-week, randomized, multicenter, double-blind, placebo-controlled, parallel-group, dose escalation, late phase 2 study.  ...  Dotinurad, a novel selective urate reabsorption inhibitor (SURI), reduces serum uric acid levels by selectively inhibiting urate transporter 1 (URAT1) for the treatment of hyperuricemia with or without  ...  Methods Study design This was a late phase 2, 12-week, randomized, multicenter, double-blind, placebo-controlled, parallel-group, dose escalation study performed at 14 clinical institutions in Japan.  ... 
doi:10.1007/s10157-019-01818-2 pmid:31792640 fatcat:le4rj3neczbgliuuu77adgy4wa

Clinical efficacy and safety of dotinurad, a novel selective urate reabsorption inhibitor, in Japanese hyperuricemic patients with or without gout: an exploratory, randomized, multicenter, double-blind, placebo-controlled, parallel-group early phase 2 study

Tatsuo Hosoya, Takafumi Sano, Tomomitsu Sasaki, Masahiko Fushimi, Tetsuo Ohashi
2019 Clinical and Experimental Nephrology  
It was a randomized, multicenter, double-blind, placebo-controlled, parallel-group study, and performed in a dose escalation manner.  ...  Dotinurad, a novel selective urate reabsorption inhibitor (SURI) that has a future potential for the treatment of hyperuricemia, reduces serum uric acid levels by selectively inhibiting urate transporter  ...  Methods Study design This exploratory phase 2, 8-week, randomized, multicenter, double-blind, placebo-controlled, parallel-group, doseescalation study was performed at six clinical institutions in Japan  ... 
doi:10.1007/s10157-019-01802-w pmid:31754882 fatcat:yjtqbkm23rfglkhx2ugomfpsii

Uric acid-lowering and renoprotective effects of topiroxostat, a selective xanthine oxidoreductase inhibitor, in patients with diabetic nephropathy and hyperuricemia: a randomized, double-blind, placebo-controlled, parallel-group study (UPWARD study)

Takashi Wada, Tatsuo Hosoya, Daisuke Honda, Ryusuke Sakamoto, Kazutaka Narita, Tomomitsu Sasaki, Daisuke Okui, Kenjiro Kimura
2018 Clinical and Experimental Nephrology  
Methods The study design was randomized, double-blind, placebo-controlled, parallel-group study.  ...  We attempted to examine the uric acid-lowering effect and the renoprotective effect of topiroxostat, a selective xanthine oxidoreductase inhibitor, in patients with diabetic nephropathy and hyperuricemia  ...  The study design was a 28-week, multicenter, randomized, doubleblind, placebo-controlled, parallel-group study. We conducted the study at 12 hospitals in Japan.  ... 
doi:10.1007/s10157-018-1530-1 pmid:29372470 fatcat:2miew3orv5bena46egllwjavya

Blinded, Double‐Dummy, Parallel‐Group, Phase 2a Randomized Clinical Trial to Evaluate the Efficacy and Safety of a Highly Selective 5‐Hydroxytryptamine Type 4 Receptor Agonist in Critically Ill Patients With Enteral Feeding Intolerance

Marianne J. Chapman, Karen L. Jones, Cristina Almansa, Chris N. Barnes, Deanna Nguyen, Adam M. Deane
2020 JPEN - Journal of Parenteral and Enteral Nutrition  
This phase 2a study compared TAK-954, a selective agonist of 5-hydroxytryptamine type 4 receptors, with metoclopramide in critically ill patients with EFI (NCT01953081).  ...  A blinded, double-dummy trial was conducted in mechanically ventilated patients with EFI (>200 mL gastric residual volume within 24 hours before randomization).  ...  Patients were selected for enrollment with the expectation that they would be alive for at least 4 days after randomization, be able to complete all study procedures, and, if receiving vasopressors at  ... 
doi:10.1002/jpen.1732 pmid:31990087 fatcat:nqxuw7eckvfwzjpfcsfrgusph4
« Previous Showing results 1 — 15 out of 1,092,513 results