Log in

Relevant bibliographies by topics / Parallel sets / Journal articles

To see the other types of publications on this topic, follow the link: Parallel sets.

Journal articles on the topic 'Parallel sets'

Author: Grafiati

Published: 30 May 2022

Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Parallel sets.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Arvind, V., and Jacobo Torán. "Sparse sets, approximable sets, and parallel queries to NP." Information Processing Letters 69, no. 4 (February 1999): 181–88. http://dx.doi.org/10.1016/s0020-0190(99)00008-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Crombez, G. "Parallel methods in image recovery by projections onto convex sets." Czechoslovak Mathematical Journal 42, no. 3 (1992): 445–50. http://dx.doi.org/10.21136/cmj.1992.128355.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Schröder, Bernd S. W. "The Automorphism Conjecture for Small Sets and Series Parallel Sets." Order 22, no. 4 (November 2005): 371–87. http://dx.doi.org/10.1007/s11083-005-9024-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Creţu, Eugen. "Parallel processing for fuzzy sets operations." Fuzzy Sets and Systems 130, no. 3 (September 2002): 305–20. http://dx.doi.org/10.1016/s0165-0114(01)00177-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Mantharam, M., and P. J. Eberlein. "New Jacobi-sets for parallel computations." Parallel Computing 19, no. 4 (April 1993): 437–54. http://dx.doi.org/10.1016/0167-8191(93)90056-q.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

-Z. Chen, Z., and X. He. "Parallel Algorithms for Maximal Acyclic Sets." Algorithmica 19, no. 3 (November 1997): 354–68. http://dx.doi.org/10.1007/pl00009178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dennig, Frederik L., Maximilian T. Fischer, Michael Blumenschein, Johannes Fuchs, Daniel A. Keim, and Evanthia Dimara. "ParSetgnostics: Quality Metrics for Parallel Sets." Computer Graphics Forum 40, no. 3 (June 2021): 375–86. http://dx.doi.org/10.1111/cgf.14314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

HARALAMBIDES, JAMES, and SPYROS TRAGOUDAS. "BIPARTITIONING INTO OVERLAPPING SETS." International Journal of Foundations of Computer Science 06, no. 01 (March 1995): 67–88. http://dx.doi.org/10.1142/s0129054195000068.

Full text

Abstract:

We consider a generalization of the min-cut partitioning problem where we partition a graph G=(V,E) into two sets V1 and V2 such that |V1∩V2|≤d, d<|V|, and such that |{(u, v)|u∈V1−V2, v∈V2−V1}| is minimized. The problem is trivially solvable using flow techniques for any fixed d, but we show that it is NP-hard for integer values of d. It remains NP-hard if we impose restrictions on the size of V1, i.e., |V1|=k, k∈Z+. The latter problem variation may apply in VLSI layout and hypertext partitioning. We present polynomial time algorithms for the special cases of solid grids and series-parallel graphs. Series-parallel graphs find applications in hypertext partitioning whereas grid graphs model the mapping of a class of Partial Differential Equation computations into parallel machines.

APA, Harvard, Vancouver, ISO, and other styles

9

Balasubramanian, Hari, John Fowler, Ahmet Keha, and Michele Pfund. "Scheduling interfering job sets on parallel machines." European Journal of Operational Research 199, no. 1 (November 2009): 55–67. http://dx.doi.org/10.1016/j.ejor.2008.10.038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Stephensen, Hans J. T., Anne Marie Svane, Carlos B. Villanueva, Steven A. Goldman, and Jon Sporring. "Measuring Shape Relations Using r-Parallel Sets." Journal of Mathematical Imaging and Vision 63, no. 8 (June 26, 2021): 1069–83. http://dx.doi.org/10.1007/s10851-021-01041-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Lin, Min-Sheng. "Counting dominating sets in generalized series-parallel graphs." Discrete Mathematics, Algorithms and Applications 11, no. 06 (December 2019): 1950074. http://dx.doi.org/10.1142/s1793830919500745.

Full text

Abstract:

Counting dominating sets in a graph is a #P-complete problem even in planar graphs. This paper studies this problem for generalized series-parallel graphs, which are a subclass of planar graphs. This work develops some linear-time algorithms for counting dominating sets and their two variants, independent dominating sets and connected dominating sets in generalized series-parallel graphs.

APA, Harvard, Vancouver, ISO, and other styles

12

Zhang, Hai Kuo, Ning Wei Sun, Chong Zhang, Ting Ting Jiang, and Chang Hua Dai. "Parallel Sets Based on the Improved ACLEARCR Algorithm." Advanced Materials Research 989-994 (July 2014): 2318–22. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.2318.

Full text

Abstract:

Classic part-labeled data visualization method Parallel Sets is applied to represent visualization of multivariate data with measures. Currently, in all walks of life emerge abundant small records and documents. Thus to sort the massive categorical measures of small value on the variable axis plays an important role in reducing clutters in the view. This paper is based on the Advanced Categories Layout basEd on Average heuRistic with Cardinality Reduction (ACLEARCR), and proposes an optimization sequence algorithm aiming at categorical measures of small value. The case study proves that the proposed method is effective.

APA, Harvard, Vancouver, ISO, and other styles

13

Rataj, Jan, and Steffen Winter. "On volume and surface area of parallel sets." Indiana University Mathematics Journal 59, no. 5 (2010): 1661–86. http://dx.doi.org/10.1512/iumj.2010.59.4165.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Giadrossi, G., R. Menis, and D. Torriano. "Excitation Control In Parallel Connected Diesel Alternator Sets." International Journal of Modelling and Simulation 6, no. 3 (January 1986): 106–11. http://dx.doi.org/10.1080/02286203.1986.11759966.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ehrhardt, Matthias Joachim, and Simon R. Arridge. "Vector-Valued Image Processing by Parallel Level Sets." IEEE Transactions on Image Processing 23, no. 1 (January 2014): 9–18. http://dx.doi.org/10.1109/tip.2013.2277775.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Delgrande, James, and Yi Jin. "Parallel belief revision: Revising by sets of formulas." Artificial Intelligence 176, no. 1 (January 2012): 2223–45. http://dx.doi.org/10.1016/j.artint.2011.10.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Pascucci, Valerio, and Kree Cole-McLaughlin. "Parallel Computation of the Topology of Level Sets." Algorithmica 38, no. 1 (November 3, 2003): 249–68. http://dx.doi.org/10.1007/s00453-003-1052-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Rantzer, Anders. "Hurwitz testing sets for parallel polytopes of polynomials." Systems & Control Letters 15, no. 2 (August 1990): 99–104. http://dx.doi.org/10.1016/0167-6911(90)90002-c.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

BOSSOMAIER, TERRY, NATALINA ISIDORO, and ADRIAN LOEFF. "DATA PARALLEL COMPUTATION OF EUCLIDEAN DISTANCE TRANSFORMS." Parallel Processing Letters 02, no. 04 (December 1992): 331–39. http://dx.doi.org/10.1142/s0129626492000477.

Full text

Abstract:

The Euclidean Distance Transform is an important, but computationally expensive, technique of computational geometry, with applications in many areas including image processing, graphics and pattern recognition. Since the data sets used are typically large, one might hope that parallel computers would be suitable for its determination. We show that existing parallel algorithms perform poorly on certain data sets and introduce new strategies. These achieve high speed on diverse data sets, but fail occasionally in pathological cases. We determine the maximum error in such cases and demonstrate that it is satisfactorily low. Although adequate efficiency is achievable on SIMD machines, we demonstrate that problems of this kind are data parallel yet best suited to MIMD architectures.

APA, Harvard, Vancouver, ISO, and other styles

20

NARAYANASWAMI, CHANDRASEKHAR, and WILLIAM RANDOLPH FRANKLIN. "DETERMINATION OF MASS PROPERTIES OF POLYGONAL CSG OBJECTS IN PARALLEL." International Journal of Computational Geometry & Applications 01, no. 04 (December 1991): 381–403. http://dx.doi.org/10.1142/s0218195991000268.

Full text

Abstract:

A parallel algorithm for determining the mass properties of objects represented in the Constructive Solid Geometry (CSG) scheme that uses polygons as primitives is presented. The algorithm exploits the fact that integration of local information around the vertices of the evaluated polygon is sufficient for the determination of its mass properties, i.e., determination of the edges and the complete topology of the evaluated polygon is not necessary. This reduces interprocessor communication and makes it suitable for parallel processing. The algorithm uses data parallelism, spatial partitioning and parallel sorting for parallelization. Tuple-sets on which simple operations have to be performed are identified. The elements of tuple-sets are distributed among the processors for parallelization. The uniform grid spatial partitioning technique is used to generate sub-problems that can be done in parallel and to reduce the cardinality of some of the tuple-sets generated in the algorithm. Parallel sorting is used to sort the tuple-sets between the data-parallel phases of the algorithm.

APA, Harvard, Vancouver, ISO, and other styles

21

Kavitha, K. "FIDOOP: PARALLEL MINING OF FREQUENT ITEM SETS USING MAPREDUCE." International Journal of Advanced Research in Computer Science 8, no. 7 (August 20, 2017): 714–19. http://dx.doi.org/10.26483/ijarcs.v8i7.4408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Jackson, Daniel J., Carmel McDougall, Ben Woodcroft, Patrick Moase, Robert A. Rose, Michael Kube, Richard Reinhardt, et al. "Parallel Evolution of Nacre Building Gene Sets in Molluscs." Molecular Biology and Evolution 27, no. 3 (November 13, 2009): 591–608. http://dx.doi.org/10.1093/molbev/msp278.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Halberda, Justin, Sean F. Sires, and Lisa Feigenson. "Multiple Spatially Overlapping Sets Can Be Enumerated in Parallel." Psychological Science 17, no. 7 (July 2006): 572–76. http://dx.doi.org/10.1111/j.1467-9280.2006.01746.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Johnson, T. W., and P. J. Slater. "MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS." Quaestiones Mathematicae 16, no. 3 (July 1993): 351–70. http://dx.doi.org/10.1080/16073606.1993.9631742.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Minchao, Wu Zhang, Wang Ding, Dongbo Dai, Huiran Zhang, Hao Xie, Luonan Chen, Yike Guo, and Jiang Xie. "Parallel Clustering Algorithm for Large-Scale Biological Data Sets." PLoS ONE 9, no. 4 (April 4, 2014): e91315. http://dx.doi.org/10.1371/journal.pone.0091315.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Bercea, Ioana O., Navin Goyal, David G. Harris, and Aravind Srinivasan. "On Computing Maximal Independent Sets of Hypergraphs in Parallel." ACM Transactions on Parallel Computing 3, no. 1 (June 28, 2016): 1–13. http://dx.doi.org/10.1145/2938436.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Shoudai, Takayoshi, and Satoru Miyano. "Using maximal independent sets to solve problems in parallel." Theoretical Computer Science 148, no. 1 (August 1995): 57–65. http://dx.doi.org/10.1016/0304-3975(94)00221-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Sheni, Hong, and D. J. Evans. "Fast sequential and parallel algorithms for finding extremal sets." International Journal of Computer Mathematics 61, no. 3-4 (January 1996): 195–211. http://dx.doi.org/10.1080/00207169608804512.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Seleit, Ali, Isabel Krämer, Elizabeth Ambrosio, Nicolas Dross, Ulrike Engel, and Lázaro Centanin. "Sequential organogenesis sets two parallel sensory lines in medaka." Development 144, no. 4 (January 13, 2017): 687–97. http://dx.doi.org/10.1242/dev.142752.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

KHACHIYAN, LEONID, ENDRE BOROS, VLADIMIR GURVICH, and KHALED ELBASSIONI. "COMPUTING MANY MAXIMAL INDEPENDENT SETS FOR HYPERGRAPHS IN PARALLEL." Parallel Processing Letters 17, no. 02 (June 2007): 141–52. http://dx.doi.org/10.1142/s0129626407002934.

Full text

Abstract:

A hypergraph [Formula: see text] is called uniformly δ-sparse if for every nonempty subset X ⊆ V of vertices, the average degree of the sub-hypergraph of [Formula: see text] induced by X is at most δ. We show that there is a deterministic algorithm that, given a uniformly δ-sparse hypergraph [Formula: see text], and a positive integer k, outputs k or all minimal transversals for [Formula: see text] in O(δ log (1 + k) polylog (δ|V|))-time using |V|O( log δ)kO(δ) processors. Equivalently, the algorithm can be used to compute in parallel k or all maximal independent sets for [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

31

Ordonez, Carlos, Naveen Mohanam, and Carlos Garcia-Alvarado. "PCA for large data sets with parallel data summarization." Distributed and Parallel Databases 32, no. 3 (September 10, 2013): 377–403. http://dx.doi.org/10.1007/s10619-013-7134-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Chen, D. Z., W. Chen, K. Wada, and K. Kawaguchi. "Parallel Algorithms for Partitioning Sorted Sets and Related Problems." Algorithmica 28, no. 2 (October 2000): 217–41. http://dx.doi.org/10.1007/s004530010037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Pearson, D., and V. V. Vazirani. "Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets." Journal of Algorithms 14, no. 2 (March 1993): 171–79. http://dx.doi.org/10.1006/jagm.1993.1008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

THANH, HOANG CHI. "PARALLEL COMBINATORIAL ALGORITHMS FOR MULTI-SETS AND THEIR APPLICATIONS." International Journal of Software Engineering and Knowledge Engineering 23, no. 01 (February 2013): 81–99. http://dx.doi.org/10.1142/s0218194013400068.

Full text

Abstract:

In this paper we extend some well-known notions of combinatorics on multi-sets such as iterative permutation, multi-subset, iterative combination and then construct new efficient algorithms for generating all iterative permutations, multi-subsets and iterative combinations of a multi-set. Applying the parallelizing method based on output decomposition we parallelize the algorithms. Furthermore, we use these algorithms to solve an optimal problem of work arrangement and an extended knapsack one.

APA, Harvard, Vancouver, ISO, and other styles

35

SEGAL, MICHAEL. "ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS." International Journal of Computational Geometry & Applications 09, no. 03 (June 1999): 219–33. http://dx.doi.org/10.1142/s0218195999000157.

Full text

Abstract:

We consider the p-piercing problem for axis-parallel rectangles. We are given a collection of axis-parallel rectangles in the plane and wish to determine whether there exists a set of p points whose union intersects all the given rectangles. We present efficient algorithms for finding a piercing set (i.e, a set of p points as above) for values of p=1,2,3,4,5. The result for 4 and 5-piercing improves an existing result of O(n log 3 n) and O(n log 4 n) to O(n log n) time. The result for 5-piercing can be applied find an O(n log 2 n) time algorithm for planar rectilinear 5-center problem, in which we are given a set S of n points in the pane, and wish to find 5 axis-parallel congruent squares of smallest possible size whose union covers S. We improve the existing algorithm for general (but fixed) p to O(np-4 log n) running time, and we also extend our algorithms to higher dimensional space. We also consider the problem of piercing a set of rectangular rings.

APA, Harvard, Vancouver, ISO, and other styles

36

Tarnapowicz, Dariusz. "Use of Transformer Multi-Level Inverters in Parallel Operation of Marine Generating Sets with PMSG." Multidisciplinary Aspects of Production Engineering 1, no. 1 (September 1, 2018): 1–7. http://dx.doi.org/10.2478/mape-2018-0001.

Full text

Abstract:

Abstract The increase of energy efficiency in autonomous marine generating sets improves the overall efficiency of the ship’s propulsion. One of the methods to increase the efficiency of generating sets is the use of synchronous machines with permanent magnets in sets as generators (PMSG). The use of PMSG in connected with the need to install power converters in order to maintain constant parameters of the supply voltage and the possibility of reactive power’s distribution between generating sets that work in parallel. The article presents the possibility of using transformer multi-level inverters in parallel operation of marine generating sets with PMSG. On the basis of the results of simulation tests, the theoretical assumptions for the possibilities of active and passive power adjustment in the parallel operation of generating sets were confirmed.

APA, Harvard, Vancouver, ISO, and other styles

37

Yang, Jialun, Feng Gao, Qiaode Jeffrey Ge, Xianchao Zhao, Weizhong Guo, and Zhenlin Jin. "Type synthesis of parallel mechanisms having the first class GF sets and one-dimensional rotation." Robotica 29, no. 6 (February 25, 2011): 895–902. http://dx.doi.org/10.1017/s0263574711000105.

Full text

Abstract:

SUMMARYA method is presented for the type synthesis of a class of parallel mechanisms having one-dimensional (1D) rotation based on the theory of Generalized Function sets (GF sets for short), which contain two classes. The type synthesis of parallel mechanisms having the first class GF sets and 1D rotation is investigated. The Law of one-dimensional rotation is given, which lays the theoretical foundation for the intersection operations of GF sets. Then the kinematic limbs with specific characteristics are designed according to the 2D and 3D axis movement theorems. Finally, several synthesized parallel mechanisms have been sketched to show the effectiveness of the proposed methodology.

APA, Harvard, Vancouver, ISO, and other styles

38

FALCONER, K. J., and M. JÄRVENPÄÄ. "Packing dimensions of sections of sets." Mathematical Proceedings of the Cambridge Philosophical Society 125, no. 1 (January 1999): 89–104. http://dx.doi.org/10.1017/s0305004198002977.

Full text

Abstract:

We obtain a formula for the essential supremum of the packing dimensions of the sections of sets parallel to a given subspace. This depends on a variant of packing dimension defined in terms of local projections of sets.

APA, Harvard, Vancouver, ISO, and other styles

39

NAKAMURA, AKIRA. "SOME NOTES ON PARALLEL COORDINATE GRAMMARS." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 05 (October 1995): 753–61. http://dx.doi.org/10.1142/s0218001495000304.

Full text

Abstract:

In a coordinate grammar, the rewriting rules replace sets of symbols having given coordinates by sets of symbols whose coordinates are given functions of the coordinates of the original symbols. Usually, at each step of a derivation, only one rule is applied and only one instance of its left hand side is rewritten. This type is referred to sequential grammars. As a counterpart of this grammar, parallel coordinate grammars are defined as generalized parallel isometric grammars. In the parallel grammars, the rewriting rule are used in parallel in a derivation application. The paper discusses some properties of parallel coordinate grammars and examines a relationship between the sequential coordinate grammars and parallel ones.

APA, Harvard, Vancouver, ISO, and other styles

40

DANG, ZHE, and OSCAR H. IBARRA. "ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE." International Journal of Foundations of Computer Science 16, no. 05 (October 2005): 867–81. http://dx.doi.org/10.1142/s0129054105003340.

Full text

Abstract:

In the standard definition of a P system, a computation step consists of a parallel application of a "maximal" set of nondeterministically chosen rules. Referring to this system as a parallel P system, we consider in this paper a sequential P system, in which each step consists of an application of a single nondeterministically chosen rule. We show the following:1. For 1-membrane purely catalytic systems (pure CS's), the sequential version is strictly weaker than the parallel version in that the former defines (i.e., generates) exactly the semilinear sets, whereas the latter is known to define nonrecursive sets.2. For 1-membrane communicating P systems (CPS's), the sequential version can only define a proper subclass of the semilinear sets, whereas the parallel version is known to define nonrecursive sets.3. Adding a new type of rule of the form: ab → axbyccomedcometo the CPS (a natural generalization of the rule ab → axbyccomein the original model), where x, y ∈ {here, out}, to the sequential 1-membrane CPS makes it equivalent to a vector addition system.4. Sequential 1-membrane symport/antiport systems (SA's) are equivalent to vector addition systems, contrasting the known result that the parallel versions can define nonrecursive sets.5. Sequential 1-membrane SA's whose rules have radius 1, (1,1), (1,2) (i.e., of the form (a, out), (a, in), (a, out; b, in), (a, out; bc, in)) generate exactly the semilinear sets. However, if the rules have radius 1, (1,1), (2,1) (i.e., of the form (ab, out; c, in)), the SA's can only generate a proper subclass of the semilinear sets.

APA, Harvard, Vancouver, ISO, and other styles

41

FON-DER-FLAASS, DMITRI, and IVAN RIVAL. "COLLECTING INFORMATION IN GRADED ORDERED SETS." Parallel Processing Letters 03, no. 03 (September 1993): 253–60. http://dx.doi.org/10.1142/s0129626493000290.

Full text

Abstract:

We consider a set of computers with precedence constraints (an ordered set) in which stored information can be passed, serially or in parallel, from one computer to any other which is an immediate successor. When is it possible to organize information transmission so that each computer receives all information from its predecessors, without duplication?

APA, Harvard, Vancouver, ISO, and other styles

42

Li, Shaoyong, Tianrui Li, Zhixue Zhang, Hongmei Chen, and Junbo Zhang. "Parallel computing of approximations in dominance-based rough sets approach." Knowledge-Based Systems 87 (October 2015): 102–11. http://dx.doi.org/10.1016/j.knosys.2015.05.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Bafna, Vineet, Babu Narayanan, and R. Ravi. "Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)." Discrete Applied Mathematics 71, no. 1-3 (December 1996): 41–53. http://dx.doi.org/10.1016/s0166-218x(96)00063-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Rataj, J., and M. Zähle. "Normal cycles of Lipschitz manifolds by approximation with parallel sets." Differential Geometry and its Applications 19, no. 1 (July 2003): 113–26. http://dx.doi.org/10.1016/s0926-2245(03)00020-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Fortier, P., A. Ruiz, and J. M. Cioffi. "Multidimensional signal sets through the shell construction for parallel channels." IEEE Transactions on Communications 40, no. 3 (March 1992): 500–512. http://dx.doi.org/10.1109/26.135720.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Zosh, J., L. Feigenson, and J. Halberda. "Infants' ability to enumerate multiple spatially-overlapping sets in parallel." Journal of Vision 7, no. 9 (March 19, 2010): 220. http://dx.doi.org/10.1167/7.9.220.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Chen, Shaojie, Lei Huang, Huitong Qiu, Mary Beth Nebel, Stewart H. Mostofsky, James J. Pekar, Martin A. Lindquist, Ani Eloyan, and Brian S. Caffo. "Parallel group independent component analysis for massive fMRI data sets." PLOS ONE 12, no. 3 (March 9, 2017): e0173496. http://dx.doi.org/10.1371/journal.pone.0173496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kosara, R., F. Bendix, and H. Hauser. "Parallel Sets: interactive exploration and visual analysis of categorical data." IEEE Transactions on Visualization and Computer Graphics 12, no. 4 (July 2006): 558–68. http://dx.doi.org/10.1109/tvcg.2006.76.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Pizzuti, C., and D. Talia. "P-autoclass: scalable parallel clustering for mining large data sets." IEEE Transactions on Knowledge and Data Engineering 15, no. 3 (May 2003): 629–41. http://dx.doi.org/10.1109/tkde.2003.1198395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Chatterjee, S., J. R. Gilbert, F. J. E. Long, R. Schreiber, and S. H. Teng. "Generating Local Addresses and Communication Sets for Data-Parallel Programs." Journal of Parallel and Distributed Computing 26, no. 1 (April 1995): 72–84. http://dx.doi.org/10.1006/jpdc.1995.1049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!