Добірка наукової літератури з теми "Matrice partitions"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Matrice partitions".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Matrice partitions"
Carayol, Cécile. "La Ligne rouge de Hans Zimmer. Matrice d’un « nouvel Hollywood » électro-minimaliste et contemplatif." Revue musicale OICRM 5, no. 2 (November 30, 2018): 79–102. http://dx.doi.org/10.7202/1054148ar.
Повний текст джерелаTomescu, Mihaela Aurelia, Lorentz Jäntschi, and Doina Iulia Rotaru. "Figures of Graph Partitioning by Counting, Sequence and Layer Matrices." Mathematics 9, no. 12 (June 18, 2021): 1419. http://dx.doi.org/10.3390/math9121419.
Повний текст джерелаLambkin, Christine L. "Partitioned Bremer support localises significant conflict in bee flies (Diptera : Bombyliidae : Anthracinae)." Invertebrate Systematics 18, no. 4 (2004): 351. http://dx.doi.org/10.1071/is04004.
Повний текст джерелаZhang, Yi, Xinwang Liu, Jiyuan Liu, Sisi Dai, Changwang Zhang, Kai Xu, and En Zhu. "Fusion Multiple Kernel K-means." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 8 (June 28, 2022): 9109–17. http://dx.doi.org/10.1609/aaai.v36i8.20896.
Повний текст джерелаAdm, Mohammad, Shaun Fallat, Karen Meagher, Shahla Nasserasr, Sarah Plosker, and Boting Yang. "Achievable multiplicity partitions in the inverse eigenvalue problem of a graph." Special Matrices 7, no. 1 (January 1, 2019): 276–90. http://dx.doi.org/10.1515/spma-2019-0022.
Повний текст джерелаLiu, Jiyuan, Xinwang Liu, Siwei Wang, Sihang Zhou, and Yuexiang Yang. "Hierarchical Multiple Kernel Clustering." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (May 18, 2021): 8671–79. http://dx.doi.org/10.1609/aaai.v35i10.17051.
Повний текст джерелаZoghlami, Mohamed Ali, Minyar Sassi Hidri, and Rahma Ben Ayed. "Consensus-Driven Cluster Analysis: Top-Down and Bottom-Up Based Split-and-Merge Classifiers." International Journal on Artificial Intelligence Tools 26, no. 04 (August 2017): 1750018. http://dx.doi.org/10.1142/s021821301750018x.
Повний текст джерелаDalfó, Cristina, and Miquel Àngel Fiol. "A general method to obtain the spectrum and local spectra of a graph from its regular partitions." Electronic Journal of Linear Algebra 36, no. 36 (July 12, 2020): 446–60. http://dx.doi.org/10.13001/ela.2020.5225.
Повний текст джерелаShen, Shuhui, and Xiaojun Zhang. "Constructions of Goethals–Seidel Sequences by Using k-Partition." Mathematics 11, no. 2 (January 6, 2023): 294. http://dx.doi.org/10.3390/math11020294.
Повний текст джерелаBenatia, Akrem, Weixing Ji, Yizhuo Wang, and Feng Shi. "Sparse matrix partitioning for optimizing SpMV on CPU-GPU heterogeneous platforms." International Journal of High Performance Computing Applications 34, no. 1 (November 14, 2019): 66–80. http://dx.doi.org/10.1177/1094342019886628.
Повний текст джерелаДисертації з теми "Matrice partitions"
Quéré, Romain. "Quelques propositions pour la comparaison de partitions non strictes." Phd thesis, Université de La Rochelle, 2012. http://tel.archives-ouvertes.fr/tel-00950514.
Повний текст джерелаBarsukov, Alexey. "On dichotomy above Feder and Vardi's logic." Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2022. https://tel.archives-ouvertes.fr/tel-04100704.
Повний текст джерелаA subset of NP is said to have a dichotomy if it contains problem that are either solvable in P-time or NP-complete. The class of finite Constraint Satisfaction Problems (CSP) is a well-known subset of NP that follows such a dichotomy. The complexity class NP does not have a dichotomy unless P = NP. For both of these classes there exist logics that are associated with them. -- NP is captured by Existential Second-Order (ESO) logic by Fagin's theorem, i.e., a problem is in NP if and only if it is expressible by an ESO sentence.-- CSP is a subset of Feder and Vardi's logic, Monotone Monadic Strict NP without inequalities (MMSNP), and for every MMSNP sentence there exists a P-time equivalent CSP problem. This implies that ESO does not have a dichotomy as well as NP, and that MMSNP has a dichotomy as well as CSP. The main objective of this thesis is to study subsets of NP that strictly contain CSP or MMSNP with respect to the dichotomy existence.Feder and Vardi proved that if we omit one of the three properties that define MMSNP, namely being monotone, monadic or omitting inequalities, then the resulting logic does not have a dichotomy. As their proofs remain sketchy at times, we revisit these results and provide detailed proofs. Guarded Monotone Strict NP (GMSNP) is a known extension of MMSNP that is obtained by relaxing the "monadic" restriction of MMSNP. We define similarly a new logic that is called MMSNP with Guarded inequalities, relaxing the restriction of being "without inequalities". We prove that it is strictly more expressive than MMSNP and that it also has a dichotomy.There is a logic MMSNP₂ that extends MMSNP in the same way as MSO₂ extends Monadic Second-Order (MSO) logic. It is known that MMSNP₂ is a fragment of GMSNP and that these two classes either both have a dichotomy or both have not. We revisit this result and strengthen it by proving that, with respect to having a dichotomy, without loss of generality, one can consider only MMSNP₂ problems over one-element signatures, instead of GMSNP problems over arbitrary finite signatures.We seek to prove the existence of a dichotomy for MMSNP₂ by finding, for every MMSNP₂ problem, a P-time equivalent MMSNP problem. We face some obstacles to build such an equivalence. However, if we allow MMSNP sentences to consist of countably many negated conjuncts, then we prove that such an equivalence exists. Moreover, the corresponding infinite MMSNP sentence has a property of being "regular". This regular property means that, in some sense, this sentence is still finite. It is known that regular MMSNP problems can be expressed by CSP on omega-categorical templates. Also, there is an algebraic dichotomy characterisation for omega-categorical CSPs that describe MMSNP problems. If one manages to extend this algebraic characterisation onto regular MMSNP, then our result would provide an algebraic dichotomy for MMSNP₂.Another potential way to prove the existence of a dichotomy for MMSNP₂ is to mimic the proof of Feder and Vardi for MMSNP. That is, by finding a P-time equivalent CSP problem. The most difficult part there is to reduce a given input structure to a structure of sufficiently large girth. For MMSNP and CSP, it is done using expanders, i.e., structures, where the distribution of tuples is close to a uniform distribution. We study this approach with respect to MMSNP₂ and point out the main obstacles. (...)
Fonseca, Tiago. "Matrices à signes alternants, boucles denses et partitions planes." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00521884.
Повний текст джерелаDinis, Da Fonseca Tiago. "Matrices de signe alternant, boucles denses et partitions planes." Paris 6, 2010. http://www.theses.fr/2010PA066281.
Повний текст джерелаCheballah, Hayat. "Combinatoire des matrices à signes alternants et des partitions planes." Paris 13, 2011. http://www.theses.fr/2011PA132054.
Повний текст джерелаPierce, Virgil. "The asymptotic expansion of the partition function of random matrices." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/280566.
Повний текст джерелаCabanal-Duvillard, Thierry. "Probabilités libres et calcul stochastique : application aux grandes matrices aléatoires." Paris 6, 1999. http://www.theses.fr/1999PA066594.
Повний текст джерелаThüne, Mario. "Eigenvalues of Matrices and Graphs." Doctoral thesis, Universitätsbibliothek Leipzig, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-120713.
Повний текст джерелаBagatini, Alessandro. "Matrix representation for partitions and Mock Theta functions." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/150232.
Повний текст джерелаIn this work, based on representations by matrices of two lines for some kind of partition (some already known and other new ones), we identify properties suggested by classifying them according to the sum of its second line. This sum always provides some properties of the related partition. If we consider unsigned versions of some Mock Theta Functions, its general term can be interpreted as generating function for some kind of partition with restrictions. To come back to the original coefficients, you can set a weight for each array and so add them to evaluate the coefficients. An analogous representation for partitions allows us to observe properties, again by classificating them according to the sum of its elements on the second row. This classification is made by means of tables created by mathematical software Maple, which suggest patterns, identities related to other known types of partitions and often, finding a closed formula to count them. Having established conjectured identities, all are proved by bijections between sets or counting methods.
Bas, Erdeniz Ozgun. "Load-Balancing Spatially Located Computations using Rectangular Partitions." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306909831.
Повний текст джерелаКниги з теми "Matrice partitions"
Claudio, Procesi, ed. Topics in hyperplane arrangements, polytopes and box-splines. New York: Springer, 2011.
Знайти повний текст джерелаSaff, E. B., Douglas Patten Hardin, Brian Z. Simanek, and D. S. Lubinsky. Modern trends in constructive function theory: Conference in honor of Ed Saff's 70th birthday : constructive functions 2014, May 26-30, 2014, Vanderbilt University, Nashville, Tennessee. Providence, Rhode Island: American Mathematical Society, 2016.
Знайти повний текст джерелаSu, Zhonggen. Random Matrices and Random Partitions Normal Convergence. World Scientific Publishing Co Pte Ltd, 2015.
Знайти повний текст джерелаParametric state space structuring. Hampton, VA: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1997.
Знайти повний текст джерелаGuhr, Thomas. Replica approach in random matrix theory. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.8.
Повний текст джерелаKeating, Jon, and Nina Snaith. Random permutations and related topics. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.25.
Повний текст джерелаMarino, Marcos. Quantum chromodynamics. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.32.
Повний текст джерелаConcini, Corrado De, and Claudio Procesi. Topics in Hyperplane Arrangements, Polytopes and Box-Splines. Springer London, Limited, 2010.
Знайти повний текст джерелаЧастини книг з теми "Matrice partitions"
Hildenbrandt, Regina. "Partitions-requirements-matrices." In Operations Research Proceedings 2001, 303–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-50282-8_38.
Повний текст джерелаBeck, J., and J. Spencer. "Balancing Matrices with Line Shifts II." In Irregularities of Partitions, 23–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-61324-1_2.
Повний текст джерелаZhang, Fuzhen. "Partitioned Matrices." In Universitext, 29–58. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4757-5797-2_2.
Повний текст джерелаHackbusch, Wolfgang. "Matrix Partition." In Hierarchical Matrices: Algorithms and Analysis, 83–116. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47324-5_5.
Повний текст джерелаHarville, David A. "Submatrices and Partitioned Matrices." In Matrix Algebra From a Statistician’s Perspective, 13–22. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/0-387-22677-x_2.
Повний текст джерелаHarville, David A. "Submatrices and Partitioned Matrices." In Matrix Algebra: Exercises and Solutions, 7–10. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0181-3_2.
Повний текст джерелаZhang, Fuzhen. "Partitioned Matrices, Rank, and Eigenvalues." In Universitext, 35–72. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1099-7_2.
Повний текст джерелаAbed, Fidaa, Ioannis Caragiannis, and Alexandros A. Voudouris. "Near-Optimal Asymmetric Binary Matrix Partitions." In Mathematical Foundations of Computer Science 2015, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48054-0_1.
Повний текст джерелаAlon, Noga, Michal Feldman, Iftah Gamzu, and Moshe Tennenholtz. "The Asymmetric Matrix Partition Problem." In Web and Internet Economics, 1–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45046-4_1.
Повний текст джерелаKuang, Da, Jaegul Choo, and Haesun Park. "Nonnegative Matrix Factorization for Interactive Topic Modeling and Document Clustering." In Partitional Clustering Algorithms, 215–43. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09259-1_7.
Повний текст джерелаТези доповідей конференцій з теми "Matrice partitions"
Sankhavara, C. D., and H. J. Shukla. "Influence of Partition Location on Natural Convection in a Partitioned Enclosure." In ASME 2005 Summer Heat Transfer Conference collocated with the ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems. ASMEDC, 2005. http://dx.doi.org/10.1115/ht2005-72093.
Повний текст джерелаKang, Zhao, Zipeng Guo, Shudong Huang, Siying Wang, Wenyu Chen, Yuanzhang Su, and Zenglin Xu. "Multiple Partitions Aligned Clustering." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/375.
Повний текст джерелаGobel, Andreas, Leslie Ann Goldberg, Colin McQuillan, David Richerby, and Tomoyuki Yamakami. "Counting List Matrix Partitions of Graphs." In 2014 IEEE Conference on Computational Complexity (CCC). IEEE, 2014. http://dx.doi.org/10.1109/ccc.2014.14.
Повний текст джерелаLangr, Daniel, and Ivan Šimeček. "On Memory Footprints of Partitioned Sparse Matrices." In 2017 Federated Conference on Computer Science and Information Systems. IEEE, 2017. http://dx.doi.org/10.15439/2017f70.
Повний текст джерелаQiu, Chen, and Jian S. Dai. "Constraint Stiffness Construction and Decomposition of a SPS Orthogonal Parallel Mechanism." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-46811.
Повний текст джерелаSugino, Fumihiko. "U-duality from matrix membrane partition function." In STRING THEORY; 10th Tohwa University International Symposium on String Theory. AIP, 2002. http://dx.doi.org/10.1063/1.1454380.
Повний текст джерелаLin, Po Ting, Yu-Cheng Chou, Mark Christian E. Manuel, and Kuan Sung Hsu. "Investigation of Numerical Performance of Partitioning and Parallel Processing of Markov Chain (PPMC) for Complex Design Problems." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34652.
Повний текст джерелаFabregat-Traver, Diego, Paolo Bientinesi, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Automatic Generation of Partitioned Matrix Expressions for Matrix Operations." In ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010. AIP, 2010. http://dx.doi.org/10.1063/1.3498598.
Повний текст джерелаStrofylas, Giorgos A., Georgios I. Mazanakis, Sotirios S. Sarakinos, Georgios N. Lygidakis, and Ioannis K. Nikolos. "On the Use of Improved Radial Basis Functions Methods in Fluid-Structure Interaction Simulations." In ASME 2016 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/imece2016-66412.
Повний текст джерелаChou, Chiu-Chih, Thong Nguyen, and Jose E. Schutt-Aine. "Impact of Partition Schemes in Loewner Matrix Macromodeling." In 2020 IEEE Electrical Design of Advanced Packaging and Systems (EDAPS). IEEE, 2020. http://dx.doi.org/10.1109/edaps50281.2020.9312918.
Повний текст джерелаЗвіти організацій з теми "Matrice partitions"
Brenan, J. M., K. Woods, J. E. Mungall, and R. Weston. Origin of chromitites in the Esker Intrusive Complex, Ring of Fire Intrusive Suite, as revealed by chromite trace element chemistry and simple crystallization models. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328981.
Повний текст джерела